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;


signed main(){
    int N;cin >> N;
    vector<int> vec;
    for(int i = 0;i < N;i++){
        int b;cin >> b;
        vec.push_back(b);
    }
    for(int i = 0;i < N-1;i++){
        for(int j = i + 1;j < N;j++){
            if(abs(vec.at(i) - vec.at(j)) % (N-1) == 0){
                cout<<vec.at(i)<<" "<<vec.at(j)<<endl;
                return 0;
            }
        }
    }
}

