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 = 1e5;
void solve() {
  int n;
  cin >> n;
  int sx, sy;
  cin >> sx >> sy;
  int arr[4] = {};
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    if (x < sx)
      arr[0]++;
    else if (x > sx)
      arr[1]++;
    if (y < sy)
      arr[2]++;
    else if (y > sy)
      arr[3]++;
  }
  int maxx = *max_element(arr, arr + 4);
  cout << maxx << "\n";
  if (maxx == arr[0])
    cout << sx - 1 << " " << sy << "\n";
  else if (maxx == arr[1])
    cout << sx + 1 << " " << sy << "\n";
  else if (maxx == arr[2])
    cout << sx << " " << sy - 1 << "\n";
  else
    cout << sx << " " << sy + 1 << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
