#include <bits/stdc++.h>

using namespace std;

int main()
{
    ifstream cin("f.txt");
    int n;
    cin>>n;
    int erk[n], tav[n], mini=10000000, minie, miniv, fel, vendeg;
    fel=ceil(n/2.0);
    for(int i=0; i<n; i++)
    {
        cin>>erk[i]>>tav[i];
    }
    sort(erk, erk+n);
    sort(tav, tav+n);
    int erkemb[100005]={}, tavemb[100005]={}, e=0, v=0;
    for(int i=0; i<n; i++)
    {
        erkemb[erk[i]]++;
        tavemb[tav[i]+1]--;
    }
    vendeg=erkemb[0];
    while(v<=100005)
    {
        //cout<<e<<" tol "<<v<<" vendeg: "<<vendeg<<endl;
        if(vendeg>=fel and abs(e-v)<mini)
        {
            minie=e;
            miniv=v;
            mini=v-e;
        }
        if(vendeg<fel or e==v)
        {
            v++;
            vendeg+=erkemb[v];
        }
        else
        {
            e++;
            vendeg+=tavemb[e];
        }
    }
    cout<<mini+1<<endl<<minie<<" "<<miniv;
    return 0;
}