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 gcd

def factors(n):
    res = set()
    for i in range(1, n+1):
        if n % i == 0:
            res.add(i)

    return res

def main():
    n = int(input())
    array = [int(c) for c in input().split()]

    curr = array[0]
    for i in range(1, n):
        curr = gcd(curr, array[i])

    for e in factors(curr):
        if e in array:
            print(e)
            return

    print(-1)
    

if __name__ == '__main__':
    main()
