from math import isqrt

def divsor(x):
  arr = []
  for i in range(1,isqrt(x)+1):
    if x % i == 0:
      arr.append(i)
      if i*i != i:
        arr.append(x//i)
  return arr
    
N = int(input())
A = list(map(int,input().split()))
M = max(A)

S = set()
for a in A:
  for d in divsor(a):
    S.add(d)

S_arr = list(S)
S_arr.sort(reverse=True)
#print(S)