#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    int megy[100001] = {0}; // Count occurrences for the second value
    int jon[100001] = {0};  // Count occurrences for the first value
    int x, y, maxx = 0;
    cin >> n;

    // Start from 1 to match the second code's indexing
    for(int i = 1; i <= n; i++){
        cin >> x >> y;
        jon[x]++;
        megy[y]++;
        if (y > maxx)
            maxx = y;
    }

    int lx, ly, j = 0, ossz = 0, db = 100001; // Initialize db to 100001
    bool t = 1;

    for(int i = 1; i <= maxx; i++){
        while(j < maxx && ossz < (n + 1) / 2){
            j++;
            ossz += jon[j];
        }
        if(j == maxx && ossz < (n + 1) / 2){
            t = 0;
        }
        if(j - i + 1 < db && ossz >= (n + 1) / 2 && t && j - i + 1 > 0){
            db = j - i + 1;
            ly = j;
            lx = i;
        }
        ossz -= megy[i];
    }

    cout << db << endl;
    cout << lx << " " << ly;

    return 0;
}