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;
int cases = 1;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, sx, sy;
  cin >> n >> sx >> sy;
  vector<pair<int, int> > v;
  int bame = 0, dane = 0, up = 0, down = 0;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    v.push_back(make_pair(x, y));
    if (x < sx)
      bame++;
    else if (x > sx)
      dane++;
    else if (x == sx && y > sy)
      up++;
    else if (x == sx && y < sy)
      down++;
  }
  int maxi = max(bame, max(up, max(down, dane)));
  cout << maxi << endl;
  if (maxi == bame) {
    cout << sx - 1 << " " << sy;
  } else if (maxi = dane) {
    cout << sx + 1 << " " << sy;
  } else if (maxi == up) {
    cout << sx << " " << sy + 1;
  } else
    cout << sx << " " << sy - 1;
}
