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())
coor = []
up = 0
down = 0
left = 0
right = 0
for _ in range(n):
    x, y = map(int, input().split())
    if x == sx:
        if y > sy:
            up += 1
        else:
            down += 1
    elif y == sy:
        if x > sx:
            right += 1
        else:
            left += 1
    else:
        c = (x, y)
        coor.append(c)


if up >= right and up >= left:
    for coordinate in coor:
        if coordinate[1] > sy:
            up += 1

if down >= right and up >= left:
    for coordinate in coor:
        if coordinate[1] < sy:
            down += 1

if right >= up and right >= down:
    for coordinate in coor:
        if coordinate[0] > sx:
            right += 1
if left >= up and left >= down:
    for coordinate in coor:
        if coordinate[0] > sy:
            left += 1

best = max(up, down, left, right)
if up == best:
    print(up)
    print(sx, sy + 1)
elif down == best:
    print(down)
    print(sx, sy - 1)
elif left == best:
    print(left)
    print(sx - 1, sy)
else:
    print(right)
    print(sx + 1, sy)