countMax

def countMax(lst):
    if len(lst) == 1:
        return (lst[0],1)
    else:
        m, n0 = countMax(lst[1:]), lst[0]
        if n0 > m[0]:
            return (n0, 1 )
        else:
            return (m[0], m[1] + 1) if n0 == m[0] else m

import random

#n = int(input())
#lst = []
#while n != 0:
#    lst.append(n)
#    n = int(input())

for i in range(0,100):
    n = random.randint(2, 30)
    lst = [random.randint(-5,5) for _ in range(1, n)]
    print (countMax(lst)[1], lst.count(max(lst)))