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;

using int64 = long long;
const int INF = 1 << 30;

int main() {
  // な
  // 　な　た
  // 　　めて
  // 　よこまるた
  // 　　　るる
  // 　　　た　た

  int N, A[1000];
  cin >> N;
  for(int i = 0; i < N; i++) {
    cin >> A[i];
  }
  for(int i = 0; i < N; i++) {
    for(int j = i + 1; j < N; j++) {
      if(abs(A[i] - A[j]) % (N - 1) == 0) {
        cout << A[i] << " " << A[j] << endl;
        return (0);
      }
    }
  }
}
