#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200010;
int a[N];
struct SegTree{
  vector<pair<int,int> >t[N*4];
  vector<int>used;
  void upd(int v,int l,int r,int L,int R,int y,int i){
    if (l>R || r<L) return;
    if (l>=L && r<=R){
      if (t[v].empty() || t[v].back().first < y){
        used.push_back(v);
        t[v].push_back({y,i});
       // cout<<"SEG "<<l<<" "<<r<<" "<<y<<" "<<i<<endl;
      }
      return;
    }
    int m=(l+r)/2;
    upd(v+v,l,m,L,R,y,i);
    upd(v+v+1,m+1,r,L,R,y,i);
  }
  void get(int v,int l,int r,int pos,int x,int &ans,int ind){
    if (!t[v].empty() && t[v].back().first>x){
      pair<int,int>fnd={x,N};
      auto it=upper_bound(t[v].begin(),t[v].end(),fnd);
      ans=max(ans,ind-it->second);
    }
    if (l==r) return;
    int m=(l+r)/2;
    if (pos<=m){
      get(v+v,l,m,pos,x,ans,ind);
    } else {
      get(v+v+1,m+1,r,pos,x,ans,ind);
    }
  }
  void clear(){
    for (int i:used){
      t[i].clear();
    }
  }
};
SegTree T;
int cnt[N][4];
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;cin>>n;
  for (int i=1;i<=n;i++){
    cin>>a[i];
    for (int j=0;j<4;j++){
      cnt[i][j]=cnt[i-1][j];
    }
    cnt[i][a[i]]++;
  }
  vector<int>res(4,0);
  for (int el=0;el<4;el++){
    int ans=0;
    for (int i=1;i<=n;i++){
      int mx=0;
      for (int j=0;j<4;j++){
        if (j==el) continue;
        mx=max(mx,cnt[i][j]);
      }
      if (mx<cnt[i][el]) ans=i;
    }
    for (int other=0;other<4;other++){
      if (other==el) continue;
      vector<int>val;
      for (int i=0;i<4;i++){
        if (i==el || i==other) continue;
        val.push_back(i);
      }
      vector<vector<pair<pair<int,int>,int> > >U(n*2+2);
      vector<vector<pair<pair<int,int>,int> > >G(n*2+2);
      for (int i=1;i<=n;i++){
        if (i==n || a[i+1]==other) G[cnt[i][el]-cnt[i][other]+n].push_back({{cnt[i][val[0]]-cnt[i][el],cnt[i][val[1]]-cnt[i][el]},i});
        U[cnt[i][el]-cnt[i][other]+n+1].push_back({{cnt[i][val[0]]-cnt[i][el],cnt[i][val[1]]-cnt[i][el]},i});
      }
      for (int it=0;it<n*2+2;it++){
        if (G[it].empty() || U[it].empty()) continue;
        int j=0;
        for (auto cur:G[it]){
         // if (el==0 && other==2) cout<<"g = "<<it<<" "<<cur.first.first<<" "<<cur.first.second<<" "<<cur.second<<endl;
          while (j<U[it].size() && cur.second-U[it][j].second>ans){
            T.upd(1,1,n*2,1,U[it][j].first.first+n-1,U[it][j].first.second,U[it][j].second);
            j++;
          }
          T.get(1,1,n*2,cur.first.first+n,cur.first.second,ans,cur.second);
           // if (el==0 && other==2) cout<<"ind "<<el<<" "<<other<<" "<<ind<<" "<<cur.second<<endl;

        }
        T.clear();
      }
    }
    res[el]=ans;
  }
  for (int i=0;i<4;i++){
    cout<<res[i]<<" ";
  }
  cout<<endl;

  return 0;
}