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 eee {

	public static void main(String args[]) {
		Scanner scan=new Scanner(System.in);
		int n=scan.nextInt();
		int x=scan.nextInt();
		int y=scan.nextInt();
		int left=0;
		int right=0;
		int up=0;
		int down=0;
		
		for(int i=0;i<n;i++)
		{
			int xx=scan.nextInt();
			int yy=scan.nextInt();
			if(xx<x) {
				right++;
				
			}
			if(xx>x) {
				left++;
			}
			if(yy<y) {
				down++;
			}
			if(yy>y) {
				up++;
			}
			
			
		}
//		System.out.println(left+" "+right+" "+down+" "+up);
		int max=Math.max(left, right);
		max=Math.max(max,Math.max(down, up));
		System.out.println(max);
		if(max==left) {
			System.out.println((x+1)+" "+y);
		}else if(max==right) {
			System.out.println((x-1)+" "+y);
		}else if(max==down) {
			System.out.println(x+" "+(y+1));
		}else {
			System.out.println(x+" "+(y-1));
			
		}
	}
}
