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
#! /usr/bin/env python
# -*- coding: utf-8 -*-

n, sx, sy = map(int, input().split())
left = 0
right = 0
up = 0
down = 0
for i in range(n):
    x, y = map(int, input().split())
    if x > sx:
        right += 1
    if x < sx:
        left += 1
    if y > sy:
        up += 1
    if y < sy:
        down += 1
out = max(left, right, up, down)
print(out)
if out == left:
    print(sx-1, sy)
elif out == right:
    print(sx+1, sy)
elif out == up:
    print(sx, sy+1)
else:
    print(sx, sy-1)