// Source: https://usaco.guide/general/io

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

signed main() {
	int n;cin>>n;int a=0,b=0,currl=0,maxl=0,db=0;
	for (int i=0;i<n;i++) {
        cin>>a;
        if (a==b) {
			if(currl>0){
				db++;
			}currl=0;
        } 
		else if(i==n-1){
			db++;
			currl++;
		}
		else {
            currl++;
        }
        maxl=max(maxl, currl+1);
        b=a;
    }
	cout<<db<<endl;
    if (maxl == 0) {
        cout<<-1<<endl;
    } else {
        cout<<maxl<<endl;
    }
	/*int n,x;cin>>n>>x;
	int g=0;
	vector<int> v;
	while(n--){
		int a;cin>>a;
		v.push_back(a%(x+1));
		a-=a%(x+1);
		g+=a/(x+1);	
	}int y=0,z=0,sum=0;
	for(int i : v){
		if(i==x){
			y++;
		}
		else{
			sum+=i;
			z++;
		}
	}
	if(y<=sum){
		cout<<g+y<<endl;
	}
	else {
		while(y<=sum){
			y--;
			sum+=x;
		}
		cout<<g+y<<endl;
	}
	int n;cin>>n;
	mao<int,int> m;
	for(int i = 0;i<n;i++){
		int a;cin>>a;
		m[a]=i+1;
	}
	int moves=0;
	bool ps=false;
	while(true){
		if(ps){

		}
		else{
			for(auto i : m){
				if(i.first==n){
					cout<<moves<<endl;
					return 0;
				}
				else if(i.first!=i.second){
					m[i.first]=1;
					
				}
			}
		}
	}*/
}