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
from math import ceil
from math import factorial
from collections import Counter
from operator import itemgetter
ii = lambda: int(input())
iia = lambda: list(map(int,input().split()))
isa = lambda: list(input().split())

n,x,y = iia()
count = [0 for i in range(4)]
ans = [(x+1,y),(x-1,y),(x,y+1),(x,y-1)]
for i in range(n):
	a,b = iia()
	if(a>x):
		count[0]+=1
	if(a<x):
		count[1]+=1
	if(b>y):
		count[2]+=1
	if(b<y):
		count[3]+=1
print(max(count))
print(*ans[count.index(max(count))])