- Time limit: 1.00 s
- Memory limit: 512 MB
You are given an array of positive integers. Your task is to find two integers such that their greatest common divisor is as large as possible.
Input
The first input line has an integer : the size of the array.
The second line has integers : the contents of the array.
Output
Print the maximum greatest common divisor.
Constraints
Example
Input:
5 3 14 15 7 9
Output:
7