Ksusha is a beginner coder. Today she starts studying arrays. She has array *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, consisting of *n* positive integers.

Her university teacher gave her a task. Find such number in the array, that all array elements are divisible by it. Help her and find the number!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>), showing how many numbers the array has. The next line contains integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — the array elements.
from math import sqrt


def divisors(number):
    divs = set()
    for i in range(2, int(sqrt(number) + 1)):
        if number % i == 0:
            divs.add(i)
            divs.add(number // i)
    divs.add(number)
    return divs


n = int(input())
x = list(map(int, input().split()))
minimum = min(x)
divs = divisors(minimum)
candidates = []
for divisor in divs:
    for _ in range(n):
        if x[_] % divisor != 0:
            break
        if _ == n - 1:
            candidates.append(divisor)
for item in candidates:
    if item in x:
        print(item)
        exit()
print(-1)
