def main():
    S = input()

    n = longest(S)
    print(n)

def longest(seq):
    max_count = 0
    prev_char = None

    for current in seq:
        if prev_char != current:
            count = 1
        else:
            count += 1
        if count > max_count and current == '…':
            max_count = count
        prev_char = current

    return max_count

main()