#include <iostream>
#include <vector>

using namespace std;

const int maxLength = 100000;

int main()
{
	int n;
	vector<int> starts(maxLength, 0);
	vector<int> ends(maxLength, 0);

	cin >> n;

	int lastDay = 0;

	for (int i = 0; i < n; i++)
	{
		int s, e;
		cin >> s >> e;
		starts[s - 1]++;
		ends[e - 1]++;
		lastDay = max(lastDay, e);
	}

	int ce = 0, total = starts[0];

	int minimum = maxLength + 1;

	int se = -1;
	int ss = -1;

	float threshold = float(n) / 2;

	for (int i = 0; i < lastDay; i++)
	{
		while (total < threshold && ce < lastDay - 1)
		{
			ce++;
			total += starts[ce];
		}
		if (ce - i + 1 < minimum && total >= threshold && ce - i + 1 > 0)
		{
			minimum = ce - i + 1;
			se = ce + 1;
			ss = i + 1;
		}
		total -= ends[i];
	}

	cout << minimum << endl << ss << " " << se << endl;

	return 0;
}