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<vector>
#include<math.h>

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