#code --> gcd and lcm of n integers
#author : P sohith (n190830)
def gcd(a,b):
if((a%b) == 0):
return b
else:
return gcd(b,a%b)
n = int(input("enter no of numbers : "))
l = []
product = 1
print("enter the numbers :")
for i in range(n):
l.append(int(input("\telement "+str(i+1)+" :")))
product = product*l[i]
l.sort(reverse = True)
GCD = l[i]
for i in range(1,n,1):
GCD = gcd(GCD,l[i])
LCM = product//GCD
print("GCD of the numbers : "+str(GCD))
print("LCM of the numbers : "+str(LCM))