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

N = int(input())
A = sorted(list(map(int, input().split())))
ax = A[0]
ay = A[1]
for i in range(1, N):
    # ax/ay <= a_i/a_{i+1}
    if ax * A[i] <= ay * A[i - 1]:
        ax = A[i - 1]
        ay = A[i]
g = my_gcd(ax, ay)
print(ax // g, ay // g)