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
n, sx, sy = map(int, input().split())
up, down, left, right = 0, 0, 0, 0
for i in range(n):
    a, b = map(int, input().split())
    if a > sx:
        right += 1
    elif a < sx:
        left += 1
    if b > sy:
        up += 1
    elif  b < sy:
        down += 1
m = max(up, down, left, right)
print(m)
if m == up:
    print(sx, sy+1)
elif m == down:
    print(sx, sy-1)
elif m == left:
    print(sx-1, sy)
else:
    print(sx+1, sy)