#include <iostream>
#include <queue>
#define ll long long

using namespace std;

int main()
{
    ll n;
    cin >> n;
    vector <ll> a(n + 1), b(n + 1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> a[i] >> b[i];
    }
    vector <ll> stat(b[n] + 1);

    for (ll i = 1; i <= n; ++i)
    {
        for (ll j = 1; j <= n; ++j)
        {
            if (j == i)
                ++stat[b[i]];
            else
            {
                if (b[i] >= a[j] && b[i] <= b[j])
                    ++stat[b[i]];
            }
        }
    }

    ll db, akt = 1, el = 0, veg = 99999, k = 999999;
    for (ll i = 1; i <= n; ++i)
    {
        for (ll j = i+1; j <= n; ++j)
        {
            if (b[i] < a[j])
            {
                db = 1;
                for (ll g = j + 1; g <= n; ++g)
                    if (a[j] >= a[g] && a[j] <= b[g])
                        ++db;
                
                if (db + stat[b[i]] >= n / 2 && a[j]-b[i] < k)
                {
                    el = b[i];
                    veg = a[j];
                    k = veg - el;
                }
            }
            else if (b[i] == a[j])
            {
                if (stat[b[i]] >= n / 2)
                {
                    el = b[i];
                    veg = a[j];
                }
                break;
            }
        }
    }
    cout << k + 1 << endl << el << " " << veg;

    return 0;
}
/*
6
1 5
2 3
5 9
7 8
10 15
10 18
*/