treees.py

w = int(input())
a = [list(map(int, input().split())) for x in range(w)]
y = 0
j = []
for i in range(w):
    if i == 0:
        y = 1
    else:
        if a[i-1]==a[i]:
            y=y+1
        else:
            j.append(y,a[i-1])
t = max(j)
print(*t)