1002 : 최대공약수, 최소공배수

def gcd(a,b):
    if(a%b==0): return b
    return gcd(b,a%b)

def lcm(a,b):
    return a*b//gcd(a,b)


n = int(input())
arr=list(map(int,input().split()))

g=l=arr[0]

for i in range(1,n):
    g=gcd(g,arr[i])
    l=lcm(l,arr[i])

print(g,l)