RoAlgo Weekly Contest #0 | GCDness

Task

You are given an array with $n$ elements, which are natural numbers, numbered from $1$ to $n$.

The GCDness of a natural number $k \geq 2$ is defined as the number of values in the array that are exactly divisible by $k$. Determine the natural number with the highest GCDness. If there are multiple such numbers, you can print any of them.

Input data

The first line contains $n$, the size of the array. The next line contains the $n$ numbers from the array.

Output data

The first line should contain a single integer, the GCDness of the array.

Constraints and clarifications

• $1 \leq n \leq 100$;
• $2 \leq v_i \leq 1000$;
• If there are multiple such numbers, you can print any of them.

Example 1

stdin

5
8 9 18 90 72

stdout

9

Explanation

The GCDness value of $9$ is $4$ ($9, 18, 72, 90$ are multiples of $9$), as is the case for $2$ and $3$. You may output any of these values, as they are all correct.