Doubled GCD

There are $N$ cards in a deck, numbered from $1$ to $N$, where card $i$ has a positive integer $A_i$ written on it.

You are to perform $N - 1$ moves with the cards. In each move, you select two cards of your choice from the deck. Let $x$ and $y$ be the integers written on the selected cards, respectively. Remove both selected cards, and insert a new card into the deck with $2 \cdot \gcd(x, y)$ written on it, where $\gcd(x, y)$ is the greatest common divisor of $x$ and $y$. Note that with this one move, there will be one fewer card in the deck (as you remove two cards and insert one new card).

After all $N -1$ moves have been performed, there will be exactly one card remaining. Your goal is to maximize the integer written on the last card; output this integer.

Input begins with an integer $N$ ($2 ≤ N ≤ 100\, 000$) representing the number of cards. The next line contains $N$ integers $A_i$ ($1 ≤ A_i ≤ 10^9$) representing the number written on card $i$.

Output an integer in a single line representing the maximum possible integer written on the last card.