def ma(a , b):
    if (a>b):
        return a
    return b
def gcd(a , b):
    if (a>b):
        return gcd(b , a)
    if (a==0):
        return b
    b = b % a
    a = a+b
    b = a-b
    a = a-b
    return gcd(a , b)
n = int(input())
a = list(map(int , input().split()))
m = a[0]
for i in a:
    m = ma( m , i)
gc = 0
for i in a:
    gc = gcd(gc , m - i)
result = 0
for i in a:
    result = result + (m-i)/gc
print(int(result) , end = ' ')
print(int(gc))


