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.
package main

import (
	"fmt"
	"sort"
)


func main() {
    arr := make([]int, 0)
    var n, in int 
    fmt.Scanf("%d", &n)
	for i := 0; i < n; i++ {
		fmt.Scan(&in)
		arr = append(arr, in)
	}
	fmt.Println(arr)
	sort.Ints(arr)
	fmt.Println(arr)
	for i := 1; i < n; i++ {
		if arr[i] % arr[0] != 0 {
			fmt.Print(arr[i],-1)
			return
		}
	}
	fmt.Print(arr[0])



}