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, s_x, s_y = map(int, input().split())

east = west = north = south = 0
for i in range(n):
  x, y = map(int, input().split())
  if x < s_x:
    west += 1
  elif x > s_x:
    east += 1
  if y < s_y:
    # south-west
    south += 1
  elif y > s_y:
    north += 1

ans = max([east, west, north, south])
print(ans)

if east == ans:
  print(s_x + 1, s_y)
elif west == ans:
  print(s_x - 1, s_y)
elif north == ans:
  print(s_x, s_y + 1)
else:
  print(s_x, s_y-1)

