#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>

using namespace std;
/*
struct Event{
	int time;
	bool type;
	Event(int time, bool type) {
		this->time = time;
		this->type = type;
	}
};

bool sortEvent(Event a, Event b) {
	return a.time < b.time;
}*/

int main() {
	int N;
	cin >> N;

	map<int, vector<bool>> events;
	set<int> pts;
	vector<int> ts;

	//vector<Event> events;

	for (int i = 0, érk, táv; i < N; i++) {
		cin >> érk >> táv;
		events[érk].push_back(1);
		events[táv].push_back(0);
		
		pts.insert(érk);
		pts.insert(táv);

		//ts.push_back(érk);
		//ts.push_back(táv);
		//events.push_back(Event(érk, 1));
		//events.push_back(Event(táv, 1));
	}

	for (auto i : pts) ts.push_back(i);

	//sort(ts.begin(), ts.end());

	int c = 0, i = 0, j = 0;
	int max = c, maxi = i, maxj = j;
	while (true){
		if (c >= 3) {
			maxi = i;
			maxj = j;

			i++;
			//if (i > ts.size() - 1) break;
			for(bool e : events[ts[i-1]]) if (!e) c--;
		}else{
			j++;
			if (j > ts.size()) break;
			for(bool e: events[ts[j-1]])  if (e) c++;
		}

		if (ts[i] == 9) {
			continue;
		}
	}

	cout << ts[maxj]+1-ts[maxi] << "\n" << ts[maxi] << " " << ts[maxj] << "\n";


	return 0;
}