def divisors(n):
  lower,upper=[],[]
  i=1
  while i*i<=n:
    if n%i==0:
      lower.append(i)
      if i!=n//i:
        upper.append(n//i)
    i+=1
  return lower+upper[::-1]

def solve(a):
  ans=10**9
  ans2=-1
  kouho=set()
  for d in divisors(len(a)):
    for i in range(-2,3):
      if d+i>0:
        kouho.add(d+i)
  kouho=sorted(list(kouho))
  for x in kouho:
    last=-1
    cnt=0
    for i in a:
      if i//x!=last:
        cnt+=1
        last=i//x
    if ans>cnt*(x+1):
      ans=cnt*(x+1)
      ans2=x
  
  return ans,ans2


n=int(input())
a=list(map(int,input().split()))
ans,ans2=solve(a)
print(ans2)
print(ans)