T2. Individualistic

A sequence is termed "individualistic" if it does not contain any pair of consecutive elements that are identical. For a given non-negative integer ( N ), your task is to find the longest individualistic subsequence from the sequence of digits in the binary representation of ( N ). Additionally, if ( N ) is not zero, assume it is prefixed by an infinite number of zeros. A subsequence is defined as any sequence of elements that appear consecutively in the original sequence. Note that, by definition, any sequence of length 1 is considered individualistic.

Constraints

( 0 < N \leq 10^{19} ).

Input Format

A single line containing the number ( N ).

Output Format

A single line with the length of the longest individualistic subsequence.

Examples

Note

We can consider the number as starting with a single zero, as adding any number of zeros at the beginning does not change the result. For example, for the number 25, its binary representation is ( 011001_2 ), resulting in an answer of 2. For the number 2, its binary representation is ( 010_2 ), resulting in an answer of 3. For the number 26, its binary representation is ( 011010_2 ), resulting in an answer of 4.