In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of October 18th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #02 exercise sheet]

[IP016] Like the others?

One of these things is not like the others... but is it so? How many numbers are actually like the others?

The Problem

Write a program that determines the maximum length of consecutive identical numbers in a sequence of n positive integers.

Input

The first line of input contains an integer n, the size of the sequence to consider.

The following n lines describe the sequence. The (i+1)-the line contains s_i, the (i)-th element of the sequence s₁, s₂, ..., s_n

Output

The output should be a single line containing one integers: the length of the longest stretch of the same number, as described in the problem section.

Constraints

The following limits are guaranteed in all the test cases that will be given to your program:

8
3
3
2
2
2
5
5
2

3

Explanation of the example input 1: the largest stretch of identical numbers is 3 and is indicated in red:
3 3 2 2 2 5 5 2

5
42
30
15
2
88

1

Explanation of the example input 2: the largest stretch of identical numbers is 1 because all numbers are different.