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 <stdio.h>

int main(void) {
  int n, i, j, x = 0, y;
  scanf("%d", &n);
  int a[n];
  for(i = 0; i < n; ++i) scanf("%d", &a[i]);
  for(i = 0; i < n; ++i) {
    for(j = i + 1; j < n; ++j) if(!((a[i] - a[j]) % (n - 1))) {
      x = a[i], y = a[j];
      break;
    }
    if(x) break;
  }
  printf("%d %d\n", x, y);
  return 0;
}
