Preparando MOJI

Ksusha and Array

2000ms 262144K

Description:

Ksusha is a beginner coder. Today she starts studying arrays. She has array a1, a2, ..., an, 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!

Input:

The first line contains integer n (1 ≤ n ≤ 105), showing how many numbers the array has. The next line contains integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the array elements.

Output:

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.

Sample Input:

3
2 2 4

Sample Output:

2

Sample Input:

5
2 1 3 1 6

Sample Output:

1

Sample Input:

3
2 3 5

Sample Output:

-1

Informação

Codeforces

Provedor Codeforces

Código CF299A

Tags

brute forcenumber theorysortings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:43:41

Relacionados

Nada ainda