#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
//#define int double
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (double)(l+r)/2
const int MAXN=1e3+5;
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
int bir=0;
int iki=0;
int ans2=1;
int ans3=0;
vi a(n);
vii tut(n);
FOR(i,n){
int el;
cin>>el;
a[i]=el;
if(el==1) bir++;
else iki++;
tut[i]={bir,iki};
if(bir==iki) ans2++;
}
int p1=0;
int p2=0;
int f=0;
while(p1<n and p2<n){
int say=0;
int deg=a[p1];
if(tut[p1].fi>tut[p1].se) f=2;
else if(tut[p1].fi<tut[p1].se) f=1;
while(p2<n and a[p2]==deg){
p2++;
say++;
}
if(tut[p2-1].fi>tut[p2-1].se){
if(f==1) ans3=max(ans3,say);
f=2;
}
else if(tut[p2-1].fi<tut[p2-1].se){
if(f==2) ans3=max(ans3,say);
f=1;
}
p1=p2;
p2=p1;
}
cout<<bir sp iki<<endl;
cout<<ans2<<endl;
cout<<ans3<<endl;
}
