#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define lowbit(x) ((x) & -(x))

inline void solve() {
    int n;
    cin >> n;
    
    vector<int> a(n);
    for (int& i : a)
        cin >> i;

    vector<vector<int>> pref(n + 1, vector<int>(4));
    for (int i = 1; i <= n; ++i) {
        for (int j = 0;j  < 4; ++j)
            pref[i][j] = pref[i - 1][j];

        ++pref[i][a[i - 1]];
    }

    auto modify = [&](int x, int y, int val, vector<vector<int>> &bit) -> void {
        for (; x < size(bit); x += lowbit(x))
            for (int j = y; j < size(bit); j += lowbit(j))
                bit[x][j] = min(bit[x][j], val);
        return;
    };
    
    auto query = [&](int x, int y, const vector<vector<int>> &bit) -> int {
        int ret = 1e9;
        for (; x > 0; x -= lowbit(x))
            for (int j = y; j > 0; j -= lowbit(j))
                ret = min(ret, bit[x][j]);
        return ret;
    };

    vector<int> ans(4);
    for (int i = 0; i < 4; ++i) {
        vector<vector<int>> b(n + 1, vector<int>(4));
        for (int j = 0; j <= n; ++j) {
            for (int k = 0, f = 0; k < 3; ++k) {
                if (k == i) ++f;
                b[j][k] = pref[j][i] - pref[j][k + f] + n + 1;
            }
            b[j][3] = j;
        }

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

        vector<vector<int>> bit(2 * n + 1, vector<int>(2 * n + 1, 1e9));
        for (int j = 0, lst = 0; j <= n; ++j) {
            if (b[lst][0] != b[j][0]) {
                for (int k = lst; k < j; ++k)
                    modify(b[k][1], b[k][2], b[k][3], bit);
                lst = j;
            }
            ans[i] = max(ans[i], b[j][3] - query(b[j][1] - 1, b[j][2] - 1, bit));
        }
    }

    for (int i = 0; i < 4; ++i)
        cout << ans[i] << " \n"[i == 3];

    return;
}

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