#include <iostream>
#include <vector>
#include <climits>
#include <cmath>
using namespace std;
int start,veg,bstart,bveg;
void bestp()
    {
    if(veg-start+1<bveg-bstart+1)
        {
        bveg=veg;
        bstart=start;
        }
    }

int main()
{
    int n;
    vector<int> lelep(100002,0),ittvolt(100002,0);
    cin>>n;
    int maxt=-1;
    int tmp;
    for(int i=0;i<n;i++)
        {
        cin>>tmp;
        ittvolt[tmp]++;
        cin>>tmp;
        lelep[tmp+1]++;
        maxt=max(maxt,tmp);
        }
    for(int i=1;i<maxt+2;i++)
        lelep[i]=lelep[i-1]+lelep[i];

    for(int i=1;i<maxt+2;i++)
        ittvolt[i]=ittvolt[i-1]+ittvolt[i];
    start=veg=1;
    bstart=0;
    bveg=1e9;
    int minember=ceil(n/2);
    if(minember*2!=n)minember++;
    while(start<=veg && veg<=maxt)
        {
        //cout<<ittvolt[veg]<<" "<<lelep[start]<<" "<<minember<<"\n";
        if(ittvolt[veg]-lelep[start]>=minember)
            {
            bestp();
            start++;
            }
        else veg++;
        }
    cout<<bveg-bstart+1<<"\n"<<bstart<<" "<<bveg;
    return 0;
}