#include <bits/stdc++.h>

using namespace std;
struct id
{
    int k, v;
};
class has
{
 public:
     bool operator()(int a, int b)
     {
         return a>b;
     }
};
int main()
{
    int n, i, mi=100001, a, b;
    cin >> n;
    id t[n];
    int n2=ceil(n/2.0);
    for(i=0; i<n; i++)cin >> t[i].k >> t[i].v;
    priority_queue<int, vector<int>, has> q;
    for(i=0; i<n; i++)
    {
        q.push(t[i].v);
        while(q.size()>n2)q.pop();
        if(mi>abs(q.top()-t[i].k)  && q.size()>=n2)
        {
            mi=abs(q.top()-t[i].k);
            a=min(t[i].k, q.top());
            b=max(t[i].k, q.top());
        }
        else if(mi==abs(q.top()-t[i].k) && a>min(t[i].k, q.top()))
        {
            a=min(t[i].k, q.top());
            b=max(t[i].k, q.top());
        }
    }
    cout << mi+1 << endl;
    cout << a << " " << b;
    return 0;
}