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;
long long MOD = 1e9 + 7;
long long arr[200005];
pair<long long, long long> pt[200005];
int main() {
  long long n, x, y, maxDist = 0;
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) {
    cin >> pt[i].first >> pt[i].second;
    maxDist = max(maxDist, abs(x - pt[i].first) + abs(y - pt[i].second));
  }
  if (x - 1 >= 0)
    x--;
  else
    y--;
  long long cnt = 0;
  for (int i = 0; i < n; i++) {
    if (abs(x - pt[i].first) + abs(y - pt[i].second) <= maxDist) {
      cnt++;
    }
  }
  cout << cnt << endl;
  cout << x << " " << y << endl;
}
