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 fex(l,s):
    ast=0
    for i in range(len(l)):
        if(l[i]%s==0):
            ast+=1
    if(ast==len(l)):
        return True
    else:
        return False
n=int(input())
l=list(map(int,input().split()))
l.sort()
a=-1
for i in range(len(l)):
    if(fex(l,l[i])):
        a=l[i]
        break
    else:
        continue
print(a)