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
import sys
def kek():
    n, sx, sy = list(map(int ,input().split()))
    u, d, l, r = 0, 0, 0, 0
    for i in range(n):
        x, y = map(int ,sys.stdin.readline().split())
        if x > sx:
            u += 1
        if x < sx:
            d += 1
        if y > sy:
            r += 1
        if y < sy:
            l += 1

    maxX = max(u, d, l, r)
    print(maxX)
    if maxX == u:
        print(sx+1, sy)
    elif maxX == d:
        print(sx-1, sy)
    elif maxX == l:
        print(sx, sy-1)
    elif maxX == r:
        print(sx, sy+1)
kek()