#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n,a,b,m=0,l=0,f,mn=10000000;
    cin>>n;
    f=(n+1)/2;
    int v[100001]={0};
    vector<int> e,t;
    vector<int>::iterator c;
    for(int i=1; i<=n; i++)
    {
        cin>>a>>b;
        e.push_back(a); t.push_back(b);
        if(b>m)m=b;
        for(int j=a; j<=b; j++)v[j]++;
    }
    for(int i=0; i<n; i++)
    {
        if(v[t[i]]<f)
        {if(t[i]<e[n-1])
        {b=f-v[t[i]];
        c=lower_bound(e.begin(),e.end(),t[i]+1);
        //cout<<*c<<" ";
        b=distance(e.begin(),c)+b-1;
        //cout<<b<<" ";
        l=e[b]-t[i]+1;}}
        else l=1;
        if(l<=mn){mn=l; a=t[i];}
    }
    cout<<mn<<endl;
    cout<<a<<" "<<a+mn-1;
    return 0;
}