Pigeonhole principle

problem

Given $N$ different natural numbers $a_i$. I decided to make a pair by choosing a different natural number from the given natural numbers. Output one pair that can be created with a value difference that is a multiple of $N -1$.

It should be noted that such a pair always exists.

Example

Input

5 1 2 4 7 10

Output

2 10

inputFormat

outputFormat

Output one pair that can be created with a value difference that is a multiple of $N -1$.

It should be noted that such a pair always exists.

Example

Input

5 1 2 4 7 10

Output

2 10

样例

5
1 2 4 7 10

2 10