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 <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

int main() {
	int N, i, j;
	cin >> N;
	vector<int> a(N);
	for (int& k : a) cin >> k;
	for (i = 0; i < N - 1; ++i) {
		for (j = 1 + i; j < N; ++j) {
			if (0 == abs(a[i] - a[j]) % (N - 1)) break;
		}
		if (N != j) break;
	}
	cout << a[i] << ' ' << a[j] << endl;
}
