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;
long long n, sx, sy, x, y, d, u, l, r, m;
int main() {
  cin >> n >> sx >> sy;
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    if (x > sx) {
      r++;
    }
    if (x < sx) {
      l++;
    }
    if (y > sy) {
      u++;
    }
    if (y < sy) {
      d++;
    }
  }
  m = max(max(l, r), max(d, u));
  cout << m << endl;
  if (m == r) {
    cout << sx + 1 << ' ' << sy;
  } else if (m == l) {
    cout << sx - 1 << ' ' << sy;
  } else if (m == u) {
    cout << sx << ' ' << sy + 1;
  } else if (m == d) {
    cout << sx << ' ' << sy - 1;
  }
  return 0;
}
