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 int n, sx, sy;
  cin >> n >> sx >> sy;
  vector<pair<long long int, long long int> > v;
  long long int x, y;
  for (long long int i = 0; i < n; i++) {
    cin >> x >> y;
    v.push_back({x, y});
  }
  long long int f1 = 0, s2 = 0, th = 0, fo = 0;
  for (long long int i = 0; i < n; i++) {
    if (v[i].first >= sx) {
      f1++;
    } else if (v[i].first <= sx) {
      s2++;
    }
  }
  for (long long int i = 0; i < n; i++) {
    if (v[i].second >= sy) {
      th++;
    } else if (v[i].second <= sy) {
      fo++;
    }
  }
  long long int maxi = max(f1, max(fo, max(s2, th)));
  if (f1 == maxi) {
    cout << maxi << "\n";
    cout << sx + 1 << " " << sy;
  } else if (s2 == maxi) {
    cout << maxi << "\n";
    cout << sx - 1 << " " << sy;
  } else if (th == maxi) {
    cout << maxi << "\n";
    cout << sx << " " << sy + 1;
  } else {
    cout << maxi << "\n";
    cout << sx << " " << sy - 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
