def gcd(a, b):
  while b: a, b = b, a % b
  return a

N = int(input())
A = list(map(int, input().split()))
A.sort()
a, b = A[0], A[1]
for i in range(1, N - 1):
  aa, bb = A[i], A[i + 1]
  if a * bb - b * aa <= 0:
    a, b = aa, bb
g = gcd(a, b)
print(a // g, b // g)