#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int inf = 1000000010;

template<class T = int>
struct Bit2D {
public:
	Bit2D(std::vector<std::pair<T, T>> pts) {
		std::sort(pts.begin(), pts.end());
		for(auto a : pts) {
			if(ord.empty() || a.first != ord.back()) {
				ord.push_back(a.first);
			}
		}
		fw.resize(ord.size() + 1);
		coord.resize(fw.size());
		for(auto &a : pts) {
			std::swap(a.first, a.second);
		}
		std::sort(pts.begin(), pts.end());
		for(auto &a : pts) {
			std::swap(a.first, a.second);
			for(int on = std::upper_bound(ord.begin(), ord.end(), a.first) - ord.begin(); on < fw.size(); on += on & -on) {
				if(coord[on].empty() || coord[on].back() != a.second) {
					coord[on].push_back(a.second);
				}
			}
		}
		for(int i = 0; i < fw.size(); i++) {
			fw[i].assign(coord[i].size() + 1, inf);
		}
	}

	void upd(T x, T y, T v) {
		for(int xx = std::upper_bound(ord.begin(), ord.end(), x) - ord.begin(); xx < fw.size(); xx += xx & -xx) {
			for(int yy = std::upper_bound(coord[xx].begin(), coord[xx].end(), y) - coord[xx].begin(); yy < fw[xx].size(); yy += yy & -yy) {
				fw[xx][yy] = min(fw[xx][yy], v);
			}
		}
	}

	T qry(T x, T y) {
		T ans = inf;
		for(int xx = std::upper_bound(ord.begin(), ord.end(), x) - ord.begin(); xx > 0; xx -= xx & -xx) {
			for(int yy = std::upper_bound(coord[xx].begin(), coord[xx].end(), y) - coord[xx].begin(); yy > 0; yy -= yy & -yy) {
				ans = min(ans, fw[xx][yy]);
			}
		}
		return ans;
	}

private:
	std::vector<T> ord;
	std::vector<std::vector<T>> fw, coord;
};

int n;

int findAnswer(int n, vector<int> v)
{
    vector<pii> points = {{0, 0}};
    vector<int> f(n + 1, 0), g(n + 1, 0), h(n + 1, 0);

    for(int i = 1 ; i <= n ; i++)
    {
        f[i] = f[i - 1] + (v[i - 1] == 0) - (v[i - 1] == 1);
        g[i] = g[i - 1] + (v[i - 1] == 0) - (v[i - 1] == 2);
        h[i] = h[i - 1] + (v[i - 1] == 0) - (v[i - 1] == 3);

        points.emplace_back( g[i] , h[i] );
    }

    Bit2D bit(points);

    vector<pair<int,int>> sweep;
    vector<tuple<int,int,int>> batch;

    for(int i = 0 ; i <= n ; i++)  
        sweep.emplace_back( f[i] , i );

    sort( sweep.begin() , sweep.end() );

    int ans = 0;

    for(int i = 0 ; i < (int)sweep.size() ; i++)
    {
        if( i != 0 && sweep[i].first != sweep[i - 1].first )
        {
            while( !batch.empty() )
            {
                auto [a, b, c] = batch.back();
                batch.pop_back();

                bit.upd( a , b , c );
            }
        }

        int id = sweep[i].second;

        ans = max( ans , id - bit.qry( g[id] - 1 , h[id] - 1 ) );
        batch.emplace_back( g[id] , h[id] , id );
    }

    return ans;
}

vector<int> modify(vector<int> v, int value)
{
    vector<int> mdf = v;

    for(int i = 0 ; i < (int)v.size() ; i++)
    {
        if( v[i] == 0 )
            mdf[i] = value;
        else if( v[i] == value )
            mdf[i] = 0;
    }

    return mdf;
}

int main()
{
    int n;
    cin >> n;

    vector<int> v(n, 0);

    for(int i = 0 ; i < n ; i++)    
        cin >> v[i];

    for(int i = 0 ; i < 4 ; i++)
        cout << findAnswer( n , modify(v, i) ) << " ";
}