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 n;
int main() {
  int y, x;
  cin >> n >> x >> y;
  int a, b;
  int l, r, d, u;
  l = r = d = u = 0;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    if (a < x) l++;
    if (a > x) r++;
    if (b < y) d++;
    if (b > y) u++;
  }
  int cnt = 0;
  cnt = max(l, max(r, max(u, d)));
  if (cnt == l) x--;
  if (cnt == r) x++;
  if (cnt == u) y++;
  if (cnt == d) y--;
  cout << cnt << '\n';
  cout << x << ' ' << y << '\n';
  return 0;
}
