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 maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const long long mod = 998244353;
const double eps = 1e-10;
int main() {
  int l, r, u, d;
  int n;
  int sx, sy;
  cin >> n >> sx >> sy;
  for (int i = 1; i <= n; ++i) {
    int x, y;
    cin >> x >> y;
    l += (x < sx);
    r += (x > sx);
    u += (y > sy);
    d += (y < sy);
  }
  if (l == max(l, max(r, max(u, d)))) {
    cout << l << endl;
    cout << sx - 1 << " " << sy << endl;
  } else if (r == max(r, max(l, max(u, d)))) {
    cout << r << endl;
    cout << sx + 1 << " " << sy << endl;
  } else if (u == max(u, max(d, max(l, r)))) {
    cout << r << endl;
    cout << sx << " " << sy + 1 << endl;
  } else {
    cout << d << endl;
    cout << sx << " " << sy - 1 << endl;
  }
}
