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>
#include <algorithm>
#include <string>
using namespace std;
int N;
vector<int> v;
int main(){
    cin >> N;
    for(int i=0; i<N; ++i){
        int a; cin >> a;
        v.push_back(a);
    }
    bool flag = true;
    for(int i=0; i<N; ++i){
        for(int j=0; j<N; ++j){
            if(!flag) break;
            
            if((abs(v[i]-v[j]))%(N-1)==0&&i!=j){
                cout << v[i] << " " << v[j] << endl;
                flag = false;
            }   
        }
        
    }

    return 0;
}
