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

#include <bits/stdc++.h>
using namespace std;
int erk[100000], tav[100001], n, fele, lgk=INT_MAX , lgkk, lgkv;

int main() {
	
   
    cin>>n;
     fele=(n+1)/2;
    for(int i=1;i<=n;i++)
    {
        cin>>erk[i];
        cin>>tav[i];
        //if(tav[i]>m)m=tav[i];
    }
    sort(erk+1, erk+n+1);
    sort(tav+1, tav+n+1);

    for(int i=1;i+fele-1<=n;i++)
    {
        if(erk[i+fele-1]<tav[i])
        {
            lgk=1;
            lgkk=erk[i+fele-1];
            lgkv=erk[i+fele-1];
        }
        else{
            if(erk[i+fele-1]-tav[i]+1<lgk)
            {
                lgk=erk[i+fele-1]-tav[i]+1;
                lgkk=tav[i];
                lgkv=erk[i+fele-1];
            }
        }
    }
    cout<<lgk<<endl<<lgkk<<" "<<lgkv;
    

    return 0;
}