#include <iostream>
#include <bits/stdc++.h>
using namespace std;

struct interv
{
    int k;
    bool ki;
};
bool comp(interv a, interv b)
{
    return a.k == b.k ? a.ki : a.k < b.k;
}
int main()
{
    int n;
    cin >> n;
    vector<interv> ember(2*n);
    set<int> egysz;
    string asd;
    int mx = 0;
    bool swp = true;
    for(int i = 0; i < 2*n; i+=2)
    {
        cin >> ember[i].k;
        ember[i].ki = true;
        if(ember[i].k > mx) mx = ember[i].k;
        cin >> ember[i+1].k;
        ember[i+1].ki = false;
}
    int fel;
    if(n%2 == 1) fel = n/2 + 1;
    else fel = n/2;
    int szamlalo = 0;
    int hossz = 999999999;
    int van = 0;
    int legkh = 999999999;
    int u = 0, v = -1;
    int kezdet = 0;
    sort(ember.begin(), ember.end(), comp);
    while(v < 2*n)
    {
        while(szamlalo < fel && v != 2*n)
        {
            v++;
            if(ember[v].ki) szamlalo++;
        }
        if(v == 2*n) break;
        while(ember[u].ki && u < v) u++;
        hossz = ember[v].k-ember[u].k;
        if(hossz < legkh)
        {
            legkh = hossz;
            kezdet = ember[u].k;
        }
        u++;
        szamlalo--;
    }
    cout << legkh+1 << "\n" << kezdet << " " << kezdet+legkh;
}