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 <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <limits>
#include <sstream>

using namespace std;

int main (void)
{
	long n,a[10000];

	cin >> n;

	for (long i = 0; i < n; i++)
	{
		cin >> a[i];
	}

	int p = 0;

	sort(a,a + n);

	for (long i = 0; i < n; i++)
	{
		for (long j = 0; j < n; j++)
		{
			if (i < j && (a[j] - a[i]) % (n - 1) == 0)
			{
				cout << a[i] << " " << a[j] << endl;
				p += 1;
				break;
			}
		}
		if (p != 0)
		{
			break;
		}
	}
}
