#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n,f,a,b,d,m=0,p=0,h,mn=2147483647,l;
    cin>>n;f=(n+1)/2;
    int e[100001]={0}, t[100001]={0};
    vector<int>erk;
    for(int i=1; i<=n; i++)
    {
        cin>>a>>b;
        e[a]++;t[b]++;erk.push_back(a);
        if(b>m)m=b;
    }
    for(int i=1; i<=m; i++)
    {
        p+=e[i]-t[i];
        h=f-p;
        if(p>=f){cout<<1<<endl; cout<<i<<i; return 0;}
        else if(i<erk[n-1])
        {
            d=distance(erk.begin(),lower_bound(erk.begin(),erk.end(),i+1));
            while(h>0){h-=e[erk[d]]; d++;}
            l=erk[d]-i;
            if(l<mn)mn=l;b=i;
        }
    }
    cout<<mn<<endl;
    cout<<b<<" "<<b+mn-1;
    return 0;
}