#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int>H(n);
	for(int &i : H)cin >> i;
	bool b = false;
	int cnt = 0, max_length = -1, current_length = 0;
	for(int i = 1; i < n; i++)
	{
		if(H[i] != H[i-1] && b)
		{
			current_length++;
			max_length = max(current_length, max_length);
			
		}
		if(H[i] != H[i-1] && !b)
		{
			current_length = 2;
			cnt++;
			b = true;
			max_length = max(current_length, max_length);
		}
		if(H[i] == H[i-1] && b)b = false;
	}
	if(max_length == -1)
	{
		cout << -1;
		return 0;
	}
	cout << cnt << "\n" << max_length;
}