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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<pair<int, int>> vec(n);
    for (int i=0; i < n; i++) cin >> vec[i].first >> vec[i].second;

    int k = (n + 1) / 2;

    priority_queue<int, vector<int>, greater<int>> pq;

    int ans = INT_MAX;
    int ans_low = -1;
    int ans_high = -1;

    for (int i=0; i <  n; i++) {
        pq.push(vec[i].second);
        if ((int)pq.size() > k) {
            pq.pop();
        }
        if ((int)pq.size() == k) {
            int high = vec[i].first;
            int low = pq.top();
            if (low <= high) {
                int dist = high - low + 1;
                if (dist < ans) {
                    ans = dist;
                    ans_low = low;
                    ans_high = high;
                }
            }
        }
    }

    cout << ans << '\n' << ans_low << ' ' << ans_high << '\n';

    return 0;
}