// UUID: 3e0c041d-de72-4314-a8a9-20366818e1a0
#include <bits/stdc++.h>
using namespace std;

/* 
 1| 2| 3| 4| 5| 6| 7| 8| 9|10|11|12|13|14|15|16|17|18
--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--+--
 X| X| X| X| X|  |  |  |  |  |  |  |  |  |  |  |  |  
  | X| X|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  
  |  |  |  | X| X| X| X| X|  |  |  |  |  |  |  |  |  
  |  |  |  |  |  | X| X|  |  |  |  |  |  |  |  |  |  
  |  |  |  |  |  |  |  |  | X| X| X| X| X| X|  |  |  
  |  |  |  |  |  |  |  |  | X| X| X| X| X| X| X| X| X
 */

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	int n;
    cin >> n;
    vector<int> a(n),b(n);
    for (int i=0; i<n; i++) {
        cin >> a[i] >> b[i];
    }
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    int bestlen=INT_MAX,bestl=-1,bestr=-1;
    for (int i=0; i<=n-(n+1)/2;i++) {
        int len,l,r;
        if (b[i]<=a[n-1-(n+1)/2+i]) {
            l = b[i];
            r = a[n-1-(n+1)/2+i];
            len = r-l+1;
        } else {
            l = b[i];
            r = l;
            len = 1;
        }
        if (len<bestlen) {
            bestl = l;
            bestr = r;
            bestlen = len;
        } else if (len==bestlen&&l<bestl) {
            bestl = l;
            bestr = r;
        }
    }

    cout << bestlen << '\n' << bestl << ' ' << bestr;
}