eolymp
bolt
Try our new interface for solving problems

GCD

Time limit 1 second
Memory limit 128 MiB

Find the Greatest Common Divisor of n numbers.

Input data

The first line contains the value of n (1 < n < 101). The second line contains n positive integers. Each number is not greater than 30000.

Output data

Print the Greatest Common Divisor of n numbers.

Examples

Input example #1
2
15 25
Output example #1
5