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 <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>

#define LP(i,n) for(int i=0;i<n;i++)
#define Mset(x,v) memset(x,v,sizeof(x))
#define INF INT_MAX

using namespace std;
using LL=long long;

int I[1005];

int main(){
    int n;
    cin>>n;
    LP(i,n) cin>>I[i];
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            if(abs(I[i]-I[j])%(n-1)==0){
                cout<<I[i]<<" "<<I[j]<<endl;
                return 0;
            }
        }
    }
    return 0;
}

