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 N = 2e5 + 5;
int sx, sy, n, x, y, u, d, l, r;
int main() {
  cin >> n >> sx >> sy;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    if (sx + 1 <= x) ++r;
    if (sx - 1 >= x) ++l;
    if (sy + 1 <= y) ++d;
    if (sy - 1 >= y) ++u;
  }
  if (r >= l && r >= u && r >= d) {
    cout << r << endl << sx + 1 << " " << sy;
  } else if (l >= r && l >= u && l >= d) {
    cout << l << endl << sx - 1 << " " << sy;
  } else if (u >= l && u >= d && u >= r) {
    cout << u << endl << sx << " " << sy - 1;
  } else {
    cout << d << endl << sx << " " << sy + 1;
  }
}
