#include <bits/stdc++.h>

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