#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

void solve() {

	ll n;
	cin >> n;

	ll lim = 100000;
	ll lasttime = 0;

	ll half = (n+1)/2;

	vector<ll> start(n, 0);
	vector<ll> pref(lim+2, 0);
	for(ll i = 0; i < n; i++) {
		ll come, go;
		cin >> come >> go;
		pref[come]++;
		pref[go+1]--;
		start[i] = come;

		lasttime = max(lasttime, go);
	}

	
	for(ll i = 1; i <= lim; i++) {
		pref[i] += pref[i-1];
	}
	

	/*
	cerr << "\nv=";
	for(ll i = 1; i <= 20; i++) {
		cerr << i << " ";
	}
	cerr << "\nv=";
	for(ll i = 1; i <= 20; i++) {
		cerr << pref[i] << " ";
	}
	*/

	// minden n-re feltesszuk, hogy innen kezdodik a megoldas
	// megnezzuk, hany van amelyiknek itt meg nincs vege
	// es hany kell meg ami ezutan kezdodik, hogy meglegyen a half
	// ez utobbi megoldhato egy szortirozott vektorral

	ll intstart = -1;
	ll intend = -1;

	ll bg = 0;

	for(ll i = 1; i <= lasttime; i++) {

		// pref[i] megmondja hanyan vannak itt ebben a pillanatban

		ll already = pref[i];
		ll needed = half - already;

		ll herestart = i;
		ll hereend = -1;

		if(needed <= 0) {
			// everyone's here at the same time
			
			hereend = i;

		}else{	

			// megnezzuk, hanyat kene eloremenjunk, 
			// hogy legyen osszesen meg needed
			// tehat start[bg] az elso olyan kezdet, ami meg az adott idopontban nincs lefedve
			// es ha [bg + needed] < n meg valid index, akkor azt vesszuk mint hatsoindex
			while(bg < n && start[bg] <= i) {
				bg++;
			}

			// tehat a mostani bg index meg nincs benne
			// tehat az utolso index amit meg kell nezzunk

			// 0 1 2 3 4 5 6 7
			//    bg
			// meg kell ketto
			// akkor bg + needed - 1

			if(bg + needed - 1 < n) {
				hereend = start[bg + needed - 1];
			}

		}	

		if(hereend == -1) {
			continue;
		}

		if(intstart == -1 && intend == -1) {
			intstart = herestart;
			intend = hereend;
		}
		// ha rovidebb intervallum
		if(hereend - herestart < intend - intstart) {
			intstart = herestart;
			intend = hereend;
		}
		// ha ugyanolyan intervallum, de hamarabb kezdodik
		if(hereend - herestart == intend - intstart && herestart < intstart) {
			intstart = herestart;
			intend = hereend;
		}
		// mondjuk azt hiszem ez a legutolso nem fordulhat elo, de eh, a kod kibirja
	}

	cout << intend - intstart + 1 << "\n";
	cout << intstart << " " << intend;

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}