1 1000000000 7
1000000000 9
 3 2 2
2 4
2 1
3 6
 2 1000000000 100000
1000000000 1000000
1000000000 10000
 1 100 100
50 70
 1 100 100
101 100

1
1000000000 8 2
2 3 1
1000000000 100001 1
99 100 1
101 100
#include <bits/stdc++.h>
using namespace std;
int n, u, v, x, y, l, r, up, d, ans, ansp;
int main() {
  scanf("%d%d%d", &n, &u, &v);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x, &y);
    if (x < u) l++;
    if (y < v) up++;
    if (x > u) r++;
    if (y > v) d++;
  }
  ans = max(max(l, r), max(up, d));
  if (l == ans)
    u--;
  else if (r == ans)
    u++;
  else if (up == ans)
    v--;
  else
    v++;
  cout << u << " " << v << endl;
}
