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 i64 = int64_t;

int main(){
    int n;
    cin >> n;
    vector<int> v;
    for(int i=0;i<n;++i){
        int a;
        cin >> a;
        v.push_back(a);
    }

    for(int i=0;i<n;++i){
        for(int j=i+1;j<n;++j){
            if(abs(v[i]-v[j])%(n-1) == 0){
                cout << v[i] << " " << v[j] << endl;
                return 0;
            }
        }
    }

    return 0;
}

