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 lx = 0, ly = 0, gx = 0, gy = 0;
  for (int i = 0; i < n; ++i) {
    int tx, ty;
    cin >> tx >> ty;
    if (tx < sx)
      lx++;
    else if (tx > sx)
      gx++;
    if (ty < sy)
      ly++;
    else if (ty > sy)
      gy++;
  }
  if (lx > gx && lx > ly && lx > gy) {
    cout << lx << endl;
    cout << sx - 1 << " " << sy << endl;
  } else if (gx > ly && gx > gy) {
    cout << gx << endl;
    cout << sx + 1 << " " << sy << endl;
  } else if (ly > gy) {
    cout << ly << endl;
    cout << sx << " " << sy - 1 << endl;
  } else {
    cout << gy << endl;
    cout << sx << " " << sy + 1 << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
