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 javax.print.DocFlavor;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.nio.charset.IllegalCharsetNameException;
import java.sql.SQLOutput;
import java.util.*;



public class Main {
    static int[] arr;
    static boolean[] v;
    static long[] ans;
    static int n;
    static int[] parity;

    public static void main(String[] args) throws IOException{
        Reader.init(System.in);
        int n = Reader.nextInt();
        int x = Reader.nextInt();
        int y = Reader.nextInt();
        int u = 0;
        int d = 0;
        int l = 0;
        int r = 0;
        for (int i = 0 ; i < n ; i++){
            int x1 = Reader.nextInt();
            int y1 = Reader.nextInt();
            if (x1==x){
                if (y1 > y){
                    u++;
                }
                else{
                    d++;
                }
            }
            else if (y1==y){
                if (x1> x){
                    r++;
                }
                else{
                    l++;
                }
            }
            else if (x1 > x && y1 > y){
                r++;
                u++;
            }
            else if (x1 < x && y1 > y){
                l++;
                u++;
            }
            else if (x1 > x && y1 < y){
                r++;
                d++;
            }
            else{
                l++;
                d++;
            }
        }

        int ans = Math.max(l , Math.max(r , Math.max(u,d)));
        System.out.println(ans);
        if (ans==l){
            System.out.println((x-1) + " " + y);
        }
        else if (ans==r){
            System.out.println((x+1) + " " + y);
        }
        else if (ans==u){
            System.out.println((x) + " " + (y+1));
        }
        else if (ans==d){
            System.out.println((x) + " " + (y-1));
        }


    }

    static long fun(int pp , int i  , int hops){
        if (i<0 || i >= n){
            return Long.MAX_VALUE;
        }
        if (v[i]==true){
            if ((pp ^ parity[i])==1){
                return hops;
            }
            else{
                if (ans[i]==Long.MAX_VALUE) {
                    return Long.MAX_VALUE;
                }
                else{
                    return ans[i] + 1;
                }
            }
        }
        if ((pp ^ parity[i])==1){
            return 1;
        }
        v[i] = true;
        long num1 = fun(parity[i] , i + arr[i] , 1);
        long num2 = fun(parity[i] , i - arr[i] , 1);
        ans[i] = Math.min(num1,num2);
        if (ans[i]==Long.MAX_VALUE){
            return ans[i];
        }
        else{
            return ans[i] + 1;
        }

    }







    /*static int find(int x) {
        return parent[x] == x ? x : (parent[x] = find(parent[x]));
    }
    static void merge(int x, int y) {
        x = find(x);
        y = find(y);
        if ( x > y ){
            parent[y] = x;
        }
        else if (y > x){
            parent[x] = y;
        }
    }*/

    static Deque<Integer>[] graph ;

    static void solve()throws IOException{
        int n = Reader.nextInt();






    }

    static int dfs(int start , int cannot){
        if (start==cannot){
            return 0;
        }
        v[start] = true;
        Iterator i = graph[start].iterator();
        int cnt = 1;
        while (i.hasNext()){
            int next = (int)i.next();
            if (!v[next]){
                cnt+=dfs(next,cannot);
            }
        }
        return cnt;
    }


    public static void sortbyColumn(int arr[][], int col)
    {
        // Using built-in sort function Arrays.sort
        Arrays.sort(arr, new Comparator<int[]>() {

            @Override
            // Compare values according to columns
            public int compare(final int[] entry1,
                               final int[] entry2) {

                // To sort in descending order revert
                // the '>' Operator
                if (entry1[col] > entry2[col])
                    return 1;
                else
                    return -1;
            }
        });  // End of function call sort().
    }


    static class Node{
        long a;
        int i;
        Node(long a, int i){
            this.a = a;
            this.i = i;
        }
    }

}


class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                    reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
}
class MergeSort
{
    // Merges two subarrays of arr[].
    // First subarray is arr[l..m]
    // Second subarray is arr[m+1..r]
    void merge(int arr[], int l, int m, int r)
    {
        // Find sizes of two subarrays to be merged
        int n1 = m - l + 1;
        int n2 = r - m;

        /* Create temp arrays */
        int L[] = new int [n1];
        int R[] = new int [n2];

        /*Copy data to temp arrays*/
        for (int i=0; i<n1; ++i)
            L[i] = arr[l + i];
        for (int j=0; j<n2; ++j)
            R[j] = arr[m + 1+ j];


        /* Merge the temp arrays */

        // Initial indexes of first and second subarrays
        int i = 0, j = 0;

        // Initial index of merged subarry array
        int k = l;
        while (i < n1 && j < n2)
        {
            if (L[i] <= R[j])
            {
                arr[k] = L[i];
                i++;
            }
            else
            {
                arr[k] = R[j];
                j++;
            }
            k++;
        }

        /* Copy remaining elements of L[] if any */
        while (i < n1)
        {
            arr[k] = L[i];
            i++;
            k++;
        }

        /* Copy remaining elements of R[] if any */
        while (j < n2)
        {
            arr[k] = R[j];
            j++;
            k++;
        }
    }

    // Main function that sorts arr[l..r] using
    // merge()
    void sort(int arr[], int l, int r)
    {
        if (l < r)
        {
            // Find the middle point
            int m = (l+r)/2;

            // Sort first and second halves
            sort(arr, l, m);
            sort(arr , m+1, r);

            // Merge the sorted halves
            merge(arr, l, m, r);
        }
    }

    /* A utility function to print array of size n */
    static void printArray(int arr[])
    {
        int n = arr.length;
        for (int i=0; i<n; ++i)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    // Driver method

}

class Node implements Comparable<Node>{
    int a;
    int b;
    Node (int a , int b){
        this.a = a;
        this.b = b;
    }



    public int compareTo(Node o) {
        if ((this.a%2) == (o.a%2)){
            return (this.b - o.b);
        }
        else{
            return this.a - o.a;
        }
    }
}