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.
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b)
n=int(input())
list1=[]
str1=input()
list2=str1.split(" ")
list2_length=len(list2)
i=0
while i<=list2_length-1:
    list1.append(int(list2.pop()))
    i+=1
list1.reverse()
g=list1[0]
pan=0
for x in range(1,n):
    g=gcd(g,list[x])
for y in range(0,n):
    if g==list1[y]:
        print(list1[y])
        pan=1
        break
if pan==0:
    print("-1")