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;
const int maxn = 2e5 + 100;
int sx, sy;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  cin >> sx >> sy;
  int l = 0, r = 0, u = 0, d = 0;
  for (int i = 1, x, y; i <= n; ++i) {
    cin >> x >> y;
    if (x < sx) ++l;
    if (x > sx) ++r;
    if (y > sy) ++u;
    if (y < sy) ++d;
  }
  int mx = max(l, max(r, max(u, d)));
  cout << mx << endl;
  if (l == mx) {
    cout << sx - 1 << " " << sy << endl;
  } else if (r == mx) {
    cout << sx + 1 << " " << sy << endl;
  } else if (u == mx) {
    cout << sx << " " << sy + 1 << endl;
  } else {
    cout << sx << " " << sy - 1 << endl;
  }
  return 0;
}
