trees.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 + 1 == w:
        if a[i - 1] == a[i]:
            y = y + 1
            a.append(y)
        else:
            j.append(y)
    else:
        if a[i] == a[i + 1]:
            y = y + 1
        elif a[i] != a[i+1]:
            j.append((y + 1,a[i]))
            y = 0
t = max(j)
print(t[0],t[1])