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 N = 3e5 + 5;
int X[N], Y[N], sx, sy, n;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> sx >> sy;
  for (int i = 1; i <= n; ++i) cin >> X[i] >> Y[i];
  int ans = 0, xx = 0, yy = 0;
  int cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (X[i] < sx) ++cnt;
  if (cnt > ans) ans = cnt, xx = sx - 1, yy = sy;
  cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (X[i] > sx) ++cnt;
  if (cnt > ans) ans = cnt, xx = sx + 1, yy = sy;
  cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (Y[i] > sy) ++cnt;
  if (cnt > ans) ans = cnt, xx = sx, yy = sy + 1;
  cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (Y[i] < sy) ++cnt;
  if (cnt > ans) ans = cnt, xx = sx, yy = sy - 1;
  cout << ans << '\n' << xx << ' ' << yy;
  return 0;
}
