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 java.util.Scanner;

public class solving {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int students = sc.nextInt();
		int sx = sc.nextInt();
		int sy = sc.nextInt();

		int left = 0;
		int right = 0;
		int up = 0;
		int down = 0;

		boolean upf = false;
		boolean downf = false;
		boolean rightf = false;
		boolean leftf = false;
		for (int i = 0; i < students; i++) {

			int x = sc.nextInt();
			int y = sc.nextInt();

			if (x > sx)
				right++;
			if (x < sx)
				left++;
			if (y < sy)
				down++;
			if (y > sy)
				up++;

		}

		if (left >= right)
			if (left >= up)
				if (left >= down)
					leftf = true;
		if (right >= left)
			if (right >= up)
				if (right >= down)
					rightf = true;
		if (up >= right)
			if (up >= left)
				if (up >= down)
					upf = true;
		if (down >= right)
			if (down >= left)
				if (down >= up)
					downf = true;

		// System.out.println(up);
		if (leftf) {
			System.out.println(left);
			System.out.println(sx - 1 + " " + sy);
			return;
		}
		if (rightf) {
			System.out.println(right);
			System.out.println(sx + 1 + " " + sy);
			return;
		}
		if (downf) {
			System.out.println(down);
			System.out.println(sx + " " + (sy - 1));
			return;
		}
		if (upf) {
			System.out.println(up);
			System.out.println(sx + " " + (sy + 1));
		}

	}
}