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;
int main(){
    int N=0;
    int tmp=0;
    vector<int> natural;


    cin>>N;
    for(int i=0;i<N;i++){
        cin>> tmp;
        natural.push_back(tmp);
    }

    sort(natural.begin(), natural.end());

    for(auto itr=natural.end()-1;itr!=natural.begin();--itr){
        for(auto pulled=natural.begin();pulled!=natural.end();++pulled){
            if((*itr-*pulled)%(N-1)==0&&*itr!=*pulled){
                cout<<*itr<<" "<<*pulled<<"\n";
                return 0;
            }
        }
    }
}
