def solvelie(n, a):
    ok = 1
    ng = max(a) + 1
    while abs(ok - ng) > 1:
        mid = (ok + ng) // 2
        cnt = 0
        for v in a:
            if v % mid == 0:
                cnt += 1
        if cnt > (n + 1) // 2:
            ok = mid
        else:
            ng = mid
    return ok
    
n = int(input())

a = list(map(int,input().split()))

print(solvelie(n, a))