import bisect

n = int(input())
A = list(map(int,input().split())) + [10**20]

ans = 2*n
ansx = 1
for x in range(1,2*n):
    count = 0
    now = 0
    while now < n:
        a = A[now]
        d = a//x
        na = x*(d+1)
        nex = bisect.bisect_left(A,na)
        count += 1
        now = nex
        # print(x,a,na,A[nex],now,count)
        if count * (x+1) >= ans:
            break
    if ans > count*(x+1):
        ans = count*(x+1)
        ansx = x
print(ansx)
print(ans)