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

using namespace std;

int main()
{
    int n, i, j, max, maxi;
    cin >> n;

	vector<int> terrain(n);

	for (i = 0; i < n; i++)
	{
		cin >> terrain[i];
	}

	map<int, int> dict;


	i = 0, j = 0, max = 0, maxi = 0;

	while (j < n)
	{
		auto it2 = dict.begin();

		if (dict.size() == 2)
		{
			it2++;
		}

		if (dict.size() <= 1 || (dict.size() == 2 && abs(dict.begin().operator*().first - it2.operator*().first) == 1))
		{
			if (max < j - i)
			{
				max = j - i;
				maxi = i;
			}

			if (dict.count(terrain[j]) == 0)
			{
				dict[terrain[j]] = 1;
			}
			else
			{
				dict[terrain[j]]++;
			}

			j++;
		}
		else
		{
			if (--dict[terrain[i]] == 0)
			{
				dict.erase(terrain[i]);
			}
			i++;
		}
	}

	//még egy ellenõrzés
	auto it2 = dict.begin();

	if (dict.size() == 2)
	{
		it2++;
	}

	if (dict.size() <= 1 || (dict.size() == 2 && abs(dict.begin().operator*().first - it2.operator*().first) == 1))
	{
		if (max < j - i)
		{
			max = j - i;
			maxi = i;
		}
	}

	cout << max << ' ' << maxi + 1;
}