// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;cin>>n;
    vector<int> v(n);
    vector<int> hossz(100002),ujak(100002);
    for(int i = 0;i<n;i++){
        int erk,tav;cin>>erk>>tav;
        hossz[erk]++;
        hossz[tav+1]--;
        ujak[erk]++;
    }
    for(int i = 1;i<=100001;i++){
        hossz[i]+=hossz[i-1];
        ujak[i]+=ujak[i-1];
        //cout<<hossz[i]<<' '<<ujak[i]<<endl;
    }
    int lo=-1,hi=100001,mi=0;
    while(lo<hi-1){
        mi=(lo+hi)/2;
        bool b=false;
        for(int i = 0;i<=100000-mi;i++){
            if(b)break;
            if(hossz[i]+ujak[i+mi]-ujak[i]>=n/2)b=true;
        }
        if(b)hi=mi;
        else lo=mi;
    }
    mi=hi;
    for(int i = 0;i<=100000-mi;i++){
        if(hossz[i]+ujak[i+mi]-ujak[i]>=n/2){
            cout<<hi+1<<endl<<i<<' '<<i+hi<<endl;
            return 0;
        }
    }return -1;
}