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 <algorithm>
using namespace std;

int n;
int a[1000];

int main() {
	int i, j;
	
	cin >> n;
	for (i = 0; i < n; i++) cin >> a[i];
	sort(a, a + n);
	
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			if ((a[j] - a[i]) % (n - 1) == 0) {
				cout << a[i] << " " << a[j] << endl;
				return 0;
			}
		}
	}
	return 0;
}
