#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n;
    cin>>n;
    int a[n+1];
    f(i,0,n)    cin>>a[i];  
    a[n]=a[n-1];
    int i=0;
    int b=1;
    vector<int> c;
    while(i<n)
    {
        if(a[i]!=a[i+1])   b++;
        if(a[i]==a[i+1])
        {
            if(b>1) c.push_back(b);
            b=1;
        }
        i++;
    }
    if(c.size()==0)
    {
        cout<<0<<"\n"<<-1<<"\n";
        return;
    }
    int maxi=0;
    for(auto x : c) maxi=max(maxi,x);
    cout<<c.size()<<"\n"<<maxi<<"\n";
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}