Repetitions

[codetheorem]

Time limit: 1.00 s Memory limit: 512 MB
You are given a DNA sequence: a string consisting of characters A, C, G, and T. Your task is to find the longest repetition in the sequence. This is a maximum-length substring containing only one type of character.

Input

The only input line contains a string of n characters.

Output

Print one integer: the length of the longest repetition.

Constraints
1≤n≤106
Example

Input:
ATTCGGGA

Output:
3

[prajwlr]

Hi. I'd love to contribute. Please assign it to me.

[codetheorem]

@prajwlr go ahead

[prajwlr]

@prajwlr go ahead

Hey @codetheorem ! I have created a pull request. Hope you find it useable. If not, please let me know the further changes to be made.

[solanki2899]

Can i do in python?

[shrinishant]

Hii, I would love to contribute to this issue.