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;

// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()

// code starts
int main()
{
  int n;cin>>n;
  vector<int> a(n);
  int i,j;
  rep(i,n)cin>>a[i];
  bool fin=false;
  rep(i,n)
  {
    rep(j,n)
    {
      if(i==j)continue;
      if(abs(a[i]-a[j])%(n-1)==0)
      {
        cout<<a[i]<<' '<<a[j]<<endl;
        fin=true;
        break;
      }
    }
    if(fin)break;
  }
}

