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, sx, sy, k, p[4] = {0, 0, 0, 0}, a, b, i, j = 0;
  cin >> n >> sx >> sy;
  for (i = 0; i < n; i++) {
    cin >> a >> b;
    if (a > sx)
      p[0]++;
    else if (a < sx)
      p[1]++;
    if (b > sy)
      p[2]++;
    else if (b < sy)
      p[3]++;
  }
  for (i = 0; i < 4; i++)
    if (p[j] <= p[i]) j = i;
  cout << p[j] << '\n';
  switch (j) {
    case 0:
      cout << sx + 1 << ' ' << sy;
      break;
    case 1:
      cout << sx - 1 << ' ' << sy;
      break;
    case 2:
      cout << sx << ' ' << sy + 1;
      break;
    case 3:
      cout << sx << ' ' << sy - 1;
      break;
  }
  return 0;
}
