from fractions import gcd
from collections import Counter
n=input()
l=map(int,raw_input().split())
l.sort()
g=0

for i in range(n):
    if l[i]-l[i-1]:
        g=gcd(g,l[-1]-l[i])
print sum((l[-1]-l[i])/g for i in range(n)),g
    
