## Max GCD

Given integers , you can choose one of them and replace it with an integer of your choice between to , possibly the same as the original integer you choose.

Find the maximum possible greatest common divisor (GCD) of the integers after your replace.

#### Input Specification

The first line contains one integer , (), the number of integers.

The second line contains integers, ().

#### Output Specification

Output one integer, the maximum possible greatest common divisor (GCD) of the integers after your replace.

#### Sample Input 1

```
3
7 6 8
```

#### Sample Output 1

`2`

#### Sample Input 2

```
3
12 15 18
```

#### Sample Output 2

`6`

#### Sample Input 3

```
2
10000 10000
```

#### Sample Output 3

`10000`

#### Explanation for Sample Input 1

You can replace with and the GCD is .

## Comments