import sys #sys.setrecursionlimit(10 ** 6) INF = float('inf') #10**20,2**63に変えるのもあり MOD = 10**9 + 7 MOD2 = 998244353 from collections import defaultdict def ceil(A,B): return -(-A//B) def solve(): def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LC(): return list(input()) def IC(): return [int(c) for c in input()] def MI(): return map(int, sys.stdin.readline().split()) N = II() A = LI() C = [0]*1000010 for a in A: C[a]+=1 Bai =[0]*1000010 Ans = [1]*(N+1) for i in range(1,1000010): for j in range(i,1000010,i): Bai[i]+=C[j] Ans[N-Bai[i]] = max(Ans[N-Bai[i]],i) mAns = 1 for k in range(N): mAns = max(Ans[k],mAns) Ans[k] = max(Ans[k],mAns) print(Ans[k]) return solve()