A group of $$$N$$$ friends is going to play a game in which each player chooses an integer $$$P_i$$$. Then an integer $$$X$$$ greater than 1 was supposed to be drawn, but Pedro found a way to cheat and can choose this value.
Each player's score is given by $$$P_i \bmod X$$$, that is, the remainder of the division of $$$P_i$$$ by $$$X$$$.
Any player whose score is equal to $$$0$$$ is called a beta, because nothing is left from the division.
Help Pedro choose a value of $$$X$$$ that maximizes the number of beta players.
The first line of the input contains a single integer $$$N$$$ ($$$1 \leq N \leq 10^{5}$$$), representing the number of players.
The second line contains $$$N$$$ integers $$$P_i$$$ ($$$2 \leq P_i \leq 10^{6}$$$), representing the value chosen by the $$$i$$$-th player.
Print a single integer $$$X$$$ $$$(2 \leq X \leq 10^{6})$$$ that maximizes the number of beta players.
If there are multiple values of $$$X$$$ that produce the same maximum number of beta players, print any of them.
52 5 4 5 3
2
219 20
19
