GESP 1-4级 -- GESP 5-8级 -- CSP-J/S --

A9050. $Ksusha and Array$

编程题普及/提高-

知识点

数组遍历整除判断最大公约数

题目描述

Ksusha is a beginner coder. Today she starts studying arrays. She has array $a_{1},a_{2},...,a_{n}$ , 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^{5})$ , showing how many numbers the array has. The next line contains integers $a_{1},a_{2},...,a_{n}$ $(1<=a_{i}<=10^{9})$ — the array elements.

输出格式

Print a single integer — the number from the array, such that all array elements are divisible by it. If such number doesn't exist, print -1. If there are multiple answers, you are allowed to print any of them.

输入输出样例

输入 #1

3
2 2 4

输出 #1

输入 #2

5
2 1 3 1 6

输出 #2

输入 #3

3
2 3 5

输出 #3

-1

上一题去做题下一题