#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n; cin >> n;
    vector<ll> v(n);
    for (int i = 0; i < n; i++){
        cin >> v[i];
    }
    ll szam = 0;
    ll maxsize = -1;
    ll cursize = 1;
    for (int i = 1; i < n; i++){
        if (v[i] == v[i-1]){
            if (cursize >= 2){
                szam++;
                if (maxsize < cursize) maxsize = cursize;
            }
            cursize = 1;
        }
        else {
            cursize++;
        }
    }
    if (cursize >= 2){
        szam++;
    }
    cout << szam << "\n";
    if (maxsize == -1) cout << -1;
    else cout << maxsize;
    return 0;
}