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;
  long long sx, sy;
  cin >> n >> sx >> sy;
  long long x[n], y[n];
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  int a = 0, b = 0, c = 0, d = 0;
  for (int i = 0; i < n; i++) {
    if (x[i] < sx) a++;
    if (x[i] > sx) b++;
    if (y[i] > sy) c++;
    if (y[i] < sy) d++;
  }
  int t = max(max(a, b), max(c, d));
  cout << t << "\n";
  if (t == a)
    cout << sx - 1 << " " << sy;
  else if (t == b)
    cout << sx + 1 << " " << sy;
  else if (t == c)
    cout << sx << " " << sy + 1;
  else
    cout << sx << " " << sy - 1;
  return 0;
}
