def find_gcd(x, y): 
    while(y): 
        x, y = y, x % y 
  
    return x 
n = int(input())
arr= list(map(int,input().split()))
narr=[]
count=0
m = max(arr)
for i in range(n):
    narr.append(m-arr[i])
    count+=(m-arr[i])
n1 = narr[0]
n2 = narr[1]
hcf = find_gcd(n1,n2)
for i in range(2,n):
    hcf=find_gcd(hcf,narr[i])
print((count//hcf),hcf)

