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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for (ll i = 0, i##_len = (n); i < i##_len; i++)

int main() {

    ll n; cin >> n;
    vector<ll> a(n);
    REP(i, n) cin >> a[i];

    vector<ll> dp(n-1, -1);
    for (ll ai : a) {
        if (dp[ai % (n-1)] == -1) {
            dp[ai % (n-1)] = ai;
        } else {
            cout << ai << " ";
            cout << dp[ai % (n-1)] << endl;
            return 0;
        }
    }

}
