EOJ-自适应编程学习平台

Your task is to find a greatest common divisor(GCD) from given integers.

Input consists from multiple test cases.The first line of each test case contains single positive integer n (1 < n < 1024) which indicates the number of integers to find a GCD. Next line contains n positive integers separated by a single space. You have to calculate a GCD from these integers. A single line containing 0 denotes the end of input.

You can assume that input integers always fit in 32-bit signed integer.

For each test case, you should output a GCD for each line.