#include <iostream>
using namespace std;
int erk[100001]{ 0 };
int tav[100001]{ 0 };
int main()
{
    int n, max=0,a,b;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a >> b;
        erk[a]++;
        tav[b]++;
        if (b > max)
            max=b;
        
    }
    /*for (int i = 1; i <= max; i++) {
        cout << erk[i] << " ";
    }
    cout << endl;
    for (int i = 1; i <= max; i++) {
        cout << tav[i] << " ";
    }*/
    int kez = 1, veg=0, ossz = 0,kezjo,vegjo,db=1000001,joe=1;
    while (kez <= max) {
        while (ossz < ((n + 1) / 2) && veg < max) {
            veg++;
            ossz += erk[veg];                
        }
        if (veg == max and ossz < (n + 1) / 2) {
            joe = 0;
        }
        cout << "veg:" << veg << " kez:" << kez << endl;
        cout << joe << endl;
        if (veg - kez+1 < db and joe==1 ) {
            db = veg - kez+1;
            kezjo = kez;
            vegjo = veg;
        }
        ossz = ossz-tav[kez];
        //cout << "ossz:" << ossz << endl;
        kez++;
        
    }
    cout << db << endl;
    cout << kezjo << " " << vegjo;

}