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>

using namespace std;

int main()
{
  int N;
  vector<int> vec_a;
  
  cin >> N;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    vec_a.push_back(a);
  }

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

  bool isPigeon = false;
  for (int i = 0; i < N - 1; i++) {
    for (int j = i + 1; j < N; j++) {
      int diff = vec_a.at(j) - vec_a.at(i);
      if (!((vec_a.at(j) - vec_a.at(i)) % (N - 1))) {
        cout << vec_a.at(i) << " " << vec_a.at(j) << endl;
        isPigeon = true;
        break;
      }
    }
    if (isPigeon) {
      break;
    }
  }
}
 

