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 main() {
  int n, x, y;
  cin >> n >> x >> y;
  int left = 0, up = 0, right = 0, down = 0;
  for (int i = 0; i < n; i++) {
    int xx, yy;
    cin >> xx >> yy;
    if (xx > x) right++;
    if (xx < x) left++;
    if (yy > y) down++;
    if (yy < y) up++;
  }
  int maxv = max(max(max(left, up), right), down);
  cout << maxv << endl;
  if (left == maxv)
    cout << x - 1 << ' ' << y << endl;
  else if (up == maxv)
    cout << x << ' ' << y - 1 << endl;
  else if (right == maxv)
    cout << x + 1 << ' ' << y << endl;
  else if (down == maxv)
    cout << x << ' ' << y + 1 << endl;
  return 0;
}
