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.
import math
import itertools as it


n, a = int(input()), list(map(int, input().split()))
g = list(it.accumulate(a, math.gcd))[-1]

divs = set()
for d in range(1, int(math.sqrt(g)) + 1):
    if g % d == 0:
        divs = divs.union({d, g // d})

ans = divs.intersection(set(a))
print(0 if len(ans) == 0 else ans.pop())
