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.
#include<stdio.h>
int main()
{
	long long int n,min=9999999999,i;
	scanf("%lld" ,&n);
	int arr[n];
	for(i=0;i<n;i++){scanf("%d" ,&arr[i]); if(min>arr[i])min=arr[i];}
	for(i=0;i<n;i++){
		if(arr[i]%min){
			printf("-1"); return 0;
		}
	}
	printf("%lld" ,min);
	return 0;
}