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;
void solve() {
  int n, sx, sy;
  cin >> n >> sx >> sy;
  int x, y, i, j;
  int u = 0, l = 0, r = 0, d = 0;
  for (i = 0; i < n; i++) {
    cin >> x >> y;
    if (sx - x > 0)
      l++;
    else if (sx - x < 0)
      r++;
    if (sy - y > 0)
      d++;
    else if (sy - y < 0)
      u++;
  }
  cout << max(max(l, r), max(u, d)) << endl;
  if (max(l, r) > max(u, d)) {
    if (l > r) {
      cout << sx - 1 << ' ' << sy << endl;
    } else {
      cout << sx + 1 << ' ' << sy << endl;
    }
  } else {
    if (u > d) {
      cout << sx << ' ' << sy + 1 << endl;
    } else {
      cout << sx << ' ' << sy - 1 << endl;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
