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

int main() {
    int n; cin >> n;
    vector<int> ns(n);
    for(auto &x: ns) {
        cin >> x;
    }

    for(int i=0; i<n; i++)
        for(int l=0; l<n; l++) {
            int a = ns[i];
            int b = ns[l];
            if (i!=l && abs(a-b) % (n-1) == 0) {
                cout << a << " " << b << endl;
                return 0;
            }
        }
}

