#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define ll long long 

using namespace std;

ll n, i, a, b, k, mini=100000001, p1, p2, j;

bool compare(pair<ll, ll> a, pair<ll, ll> b)
{
    if (a.second < b.second) return true;
    if (a.second == b.second)
    {
        if (a.first <= b.first) return true;
        return false;
    }
    return false;
}

int main()
{
    cin >> n;
    vector <pair<ll, ll> > x(n + 1, { 0,0 });

    for (i = 1; i <= n; ++i) cin >> x[i].first >> x[i].second;


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



    k = (n + 1) / 2;
    pair<ll, ll> act{ 0,0 };

    for (i = 1; i <= n - k + 1; ++i)
    {
        act = { x[i].second,x[i].second };
        for (j = 1; j < k; ++j)
        {
            //act.first = min(act.first, x[i + j].second);
            act.second = max(act.second, x[i + j].first);
        }
        if (act.second - act.first + 1 < mini)
        {
            mini = act.second - act.first + 1;
            p1 = act.first;
            p2 = act.second;
        }
    }
    cout << mini << "\n" << p1 << " " << p2;
    return 0;
}