#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

struct adat
{
    int jon, megy;
};

int i, n, j, mini, minj, tav;
priority_queue <pair <int, int>> mp;

bool comp(adat a, adat b)
{
    if (a.megy==b.megy) return a.jon<b.jon;

    return a.megy<b.megy;
}

int main()
{
    //ifstream fin("be.in"); fin>>n;
    cin>>n;
    tav=n+1;
    int fele=n/2+n%2;
    vector <adat> x(n+1);

    for (i=1; i<=n; ++i)
    {
        cin>>x[i].jon>>x[i].megy;
    }

    sort(x.begin()+1, x.end(), comp);

    for (i=1; i<fele; ++i)
        mp.push({x[i].jon, i});

    for (i=fele; i<=n; ++i)
    {
        mp.push({x[i].jon, i});

        while (!mp.empty() && mp.top().second<i-fele+1)
            mp.pop();

        //cout<<x[i-n/2+1].megy<<" "<<mp.top().first<<"\n";
        if (mp.top().first<=x[i-fele+1].megy)
        {
            tav=1;
            minj=mini=mp.top().first;
        }else if (tav>mp.top().first-x[i-fele+1].megy+1)
        {
            tav=mp.top().first-x[i-fele+1].megy+1;
            mini=x[i-fele+1].megy;
            minj=mp.top().first;
        }
    }

    cout<<tav<<"\n"<<mini<<" "<<minj;

    return 0;
}