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

#include <bits/stdc++.h>
using namespace std;
struct bencu
{
    int most;
    int jott;
}a[100001];
int l[100001] ,s, n;
int main() {
	
    cin>>n;
    int m=0;
    for(int i=1;i<=n;i++)
    {
        int b, c;
        cin>>b>>c;
        a[b].jott++;
        a[b].most++;
        a[c+1].most--;
        if(c>m)m=c;
    }
    int fele;
    if(n%2==0)fele=n/2;
    else fele=n/2+1;

    bool talalkoztam=false;
    int kul=0;

    for(int i=1;i<=m;i++)
    {
        kul+=a[i].most; 
        a[i].most=kul;
    }

    int lgk=INT_MAX;
    int legkkezd;
    int legkveg;

    /*for(int i=1;i<=m;i++)
    {   
        cout<<i<<" "<<a[i].most<<endl;
    }cout<<endl;*/
    
    for(int i=1;i<=m;i++)
    {
        int j=i;
        int p=a[i].most;
        while(p<fele && j<=m)
        {
            j++;
            p+=a[j].jott;
        }
        if(j-i+1<lgk)
        {
            lgk=j-i+1;
            legkkezd=i;
            legkveg=j;
        }
    }
    cout<<lgk<<endl<<legkkezd<<" "<<legkveg;
    

    return 0;
}