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;
void solve() {
  long long n;
  cin >> n;
  long long x, y;
  cin >> x >> y;
  long long r = 0, l = 0, t = 0, b = 0;
  while (n--) {
    long long X, Y;
    cin >> X >> Y;
    X -= x;
    Y -= y;
    if (X > 0)
      r++;
    else if (X < 0)
      l++;
    else {
      if (Y > 0)
        t++;
      else
        b++;
    }
  }
  long long mx = max({r, l, t, b});
  cout << mx << "\n";
  if (mx == r)
    cout << x + 1 << " " << y << "\n";
  else if (mx == l)
    cout << x - 1 << " " << y << "\n";
  else if (mx == t)
    cout << x << " " << y + 1 << "\n";
  else
    cout << x << " " << y - 1 << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int tt = 1;
  while (tt--) {
    solve();
  }
}
