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

int main()
{
    int n; cin >> n;
    vector <int> M(n);
    for(int i = 0; i < n; i++) cin >> M[i];
    int ans1 = 0, ans2 = 0;
    int l = 0, r = 1;
    while(r < n){
        if(r-l > 1 && M[r-1] == M[r]){
            ans1++;
            ans2 = max(ans2, r-l);
            l = r;
            r++;
        }
        else if(M[r-1] == M[r]){
            l++;
            r++;
        }
        else r++;
    }
    if(M[n-1] != M[n-2]){
        ans1++;
        ans2 = max(ans2, r-l);
    }
    if(ans1 == 0){
        cout << 0 << "\n" << -1;
        return 0;
    }
    cout << ans1 << "\n" << ans2;
    return 0;
}