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
#include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int main(void)
{
	int n,i,j,x,a[1000],x1,y1;
	scanf("%d",&n);
	for(i=0;i<n;i++)	scanf("%d",&a[i]);
	for(i=0;i<n-1;i++)	{
		for(j=i+1;j<n;j++)	{
			x=a[i]-a[j];
			if(x<0)	x=-x;
			if(x%(n-1)==0)	{
				x1=a[i];	y1=a[j];
				j=n;	i=n-1;
			}
		}
	}
	printf("%d %d\n",x1,y1);
    return 0;
}
