import sys
import math
input=sys.stdin.readline
def gcd(a,b):
    if(b==0):
        return a
    return gcd(b,a%b)
n=int(input())
arr=list(map(int,input().split()))
arr.sort()
diff=list()
for i in range(1,n):
    diff.append(arr[i]-arr[i-1])
g=diff[0]
for i in range(len(diff)):
    g=gcd(g,diff[i])
z=g
if(z==0):
    z=arr[0]
maxim=arr[-1]
ans=0
for i in range(n):
    ans+=(maxim-arr[i])//z
print(ans,z)


        
    

            
    
    
            

    
    
        
    
    
