Code for fun!

Start

2020-07-19 06:00 AKDT

Code for fun!

End

2020-07-19 10:00 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -69 days 14:15:04

4:00:00

0:00:00

Problem NReduced ID Numbers

T. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN $s$ is an integer in the range $0\le s\le \mathit{MaxSIN}$ with $\mathit{MaxSIN}=10^6-1$. T. Chur finds this range of SINs too large for identification within her groups. For each group, she wants to find the smallest positive integer $m$, such that within the group all SINs reduced modulo $m$ are unique.

Input

The first line of input contains the integer $G$ ($1\le G\le 300$): the number of students in the group. The following $G$ lines each contain one SIN. The SINs are distinct, though not necessarily sorted.

Output

Output one line containing the smallest modulus $m$, such that all SINs reduced modulo $m$ are distinct.

Sample Input 1 Sample Output 1
1
124866

1

Sample Input 2 Sample Output 2
3
124866
111111
987651

8