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 <iostream>
#include <algorithm>
using namespace std;
void main()
{
	int l = 0, r = 0, u = 0, b = 0, sx, sy,n, xi,yi;
	cin >> n >> sx >> sy;
	for (int i = 0; i < n; i++)
	{
		cin >> xi >> yi;
		if (xi > sx) r++;
		if (xi < sx) l++;
		if (yi > sy) u++;
		if (yi < sy) b++;
	}
	int mx = max(max(l, r), max(u, b));
	if (mx == l) cout << mx << "\n"<< sx - 1 << " " << sy << endl;
	else if (mx == r) cout << mx << "\n"<< sx + 1 << " " << sy << endl;
	else if (mx == u) cout << mx << "\n"<< sx << " " << sy + 1 << endl;
	else cout << b << "\n" << mx << " " << sy - 1 << endl;
}