import sys


def max_prime_factor(n):
    largest = 1

    for factor in (2, 3):
        while n % factor == 0:
            largest = factor
            n //= factor

    factor, step = 5, 2

    while factor * factor <= n:
        while n % factor == 0:
            largest = factor
            n //= factor

        factor += step
        step = 6 - step

    return max(largest, n)


data = list(map(int, sys.stdin.buffer.read().split()))
numbers = data[1:data[0] + 1]

answer = max(
    numbers,
    key=lambda n: (max_prime_factor(n), n)
)

print(answer)