#include <iostream>
//#include <fstream>
#include <vector>
#include <deque>
#include <algorithm>
#include <climits>
#include <map>
#define ll long long 

using namespace std;
//ifstream cin ("input.in");
//ofstream cout ("output.out");

ll n,m,i,j,a,b,len,start,nr,pos,mini=LLONG_MAX;

struct adat
{
    ll value,nr;
    bool st;
};

bool compare (const adat& a, const adat &b)
    {
        return a.value<b.value;
    }

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin>>n;
    vector <adat> x(2*n+1);
    for (i=1;i<=n;++i)
    {
        cin>>a>>b;
        x[2*i-1].value=a;
        x[2*i-1].nr=i;
        x[2*i-1].st=true;
        x[2*i].value=b;
        x[2*i].nr=i;
        x[2*i].st=false;
        
    }

    sort (x.begin()+1, x.end(),compare);

    //for (auto &e:x) cout<<e.value<<" "<<e.st<<"\n";

    //vector <bool> opened(n+1,false);
    map<ll,bool> opened;
    a=0;
    for (i=1;i<2*n;++i)
    {
        start=x[i].value;
        if (x[i].st) a++;//opened[x[i].nr]=true;
        nr=a;
        //for (j=1;j<=n;++j) opened[j]=false;
        //opened.clear();
        for (j=i+1;j<=2*n;++j)
        {
            if (x[j].st) 
            {
                nr++;
                //opened[x[j].nr]=true;
            }
            //else if (!opened[x[j].nr]) nr++;
            if (nr>=n/2)
            {
                if (x[j].value-start+1<mini)
                {
                    mini=x[j].value-start+1;
                    pos=start;
                }
                break;
            }
            
        }
        if (!x[i].st) a--;
    }

    cout<<mini<<"\n"<<pos<<" "<<pos+mini-1;

}