#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

const int BACKET = 118;
int N;
int Answer[4];
int A[1 << 17];
int X[1 << 17];
int Y[1 << 17];
int Z[1 << 17];
int dp[BACKET + 2][BACKET + 2][BACKET + 2];

int Solve(int cl, int cr, int idx) {
	// Initialize
	if (idx == 0) {
		X[cl] = 0;
		Y[cl] = 0;
		Z[cl] = 0;
		for (int i = cl; i < N; i++) X[i + 1] = X[i] + (A[i] == 0 ? +1 : (A[i] == 1 ? -1 : 0));
		for (int i = cl; i < N; i++) Y[i + 1] = Y[i] + (A[i] == 0 ? +1 : (A[i] == 2 ? -1 : 0));
		for (int i = cl; i < N; i++) Z[i + 1] = Z[i] + (A[i] == 0 ? +1 : (A[i] == 3 ? -1 : 0));
	}
	if (idx == 1) {
		X[cl] = 0;
		Y[cl] = 0;
		Z[cl] = 0;
		for (int i = cl; i < N; i++) X[i + 1] = X[i] + (A[i] == 1 ? +1 : (A[i] == 2 ? -1 : 0));
		for (int i = cl; i < N; i++) Y[i + 1] = Y[i] + (A[i] == 1 ? +1 : (A[i] == 3 ? -1 : 0));
		for (int i = cl; i < N; i++) Z[i + 1] = Z[i] + (A[i] == 1 ? +1 : (A[i] == 0 ? -1 : 0));
	}
	if (idx == 2) {
		X[cl] = 0;
		Y[cl] = 0;
		Z[cl] = 0;
		for (int i = cl; i < N; i++) X[i + 1] = X[i] + (A[i] == 2 ? +1 : (A[i] == 3 ? -1 : 0));
		for (int i = cl; i < N; i++) Y[i + 1] = Y[i] + (A[i] == 2 ? +1 : (A[i] == 0 ? -1 : 0));
		for (int i = cl; i < N; i++) Z[i + 1] = Z[i] + (A[i] == 2 ? +1 : (A[i] == 1 ? -1 : 0));
	}
	if (idx == 3) {
		X[cl] = 0;
		Y[cl] = 0;
		Z[cl] = 0;
		for (int i = cl; i < N; i++) X[i + 1] = X[i] + (A[i] == 3 ? +1 : (A[i] == 0 ? -1 : 0));
		for (int i = cl; i < N; i++) Y[i + 1] = Y[i] + (A[i] == 3 ? +1 : (A[i] == 1 ? -1 : 0));
		for (int i = cl; i < N; i++) Z[i + 1] = Z[i] + (A[i] == 3 ? +1 : (A[i] == 2 ? -1 : 0));
	}

	// Get Min/Max
	int lx = 0, rx = 0;
	int ly = 0, ry = 0;
	int lz = 0, rz = 0;
	for (int i = cl; i < cr; i++) lx = min(lx, X[i]);
	for (int i = cl; i < cr; i++) rx = max(rx, X[i]);
	for (int i = cl; i < cr; i++) ly = min(ly, Y[i]);
	for (int i = cl; i < cr; i++) ry = max(ry, Y[i]);
	for (int i = cl; i < cr; i++) lz = min(lz, Z[i]);
	for (int i = cl; i < cr; i++) rz = max(rz, Z[i]);
	lx -= 1; ly -= 1; lz -= 1;
	int hx = rx - lx;
	int hy = ry - ly;
	int hz = rz - lz;

	// Get Ruiseki Max
	for (int i = cr; i <= N; i++) dp[max(0, min(hx, X[i] - lx - 1))][max(0, min(hy, Y[i] - ly - 1))][max(0, min(hz, Z[i] - lz - 1))] = i;
	for (int i = hx - 1; i >= 0; i--) {
		for (int j = hy; j >= 0; j--) {
			for (int k = hz; k >= 0; k--) dp[i][j][k] = max(dp[i][j][k], dp[i + 1][j][k]);
		}
	}
	for (int i = hx; i >= 0; i--) {
		for (int j = hy - 1; j >= 0; j--) {
			for (int k = hz; k >= 0; k--) dp[i][j][k] = max(dp[i][j][k], dp[i][j + 1][k]);
		}
	}
	for (int i = hx; i >= 0; i--) {
		for (int j = hy; j >= 0; j--) {
			for (int k = hz - 1; k >= 0; k--) dp[i][j][k] = max(dp[i][j][k], dp[i][j][k + 1]);
		}
	}

	// Solve
	int Answer = 0;
	for (int i = cl; i < cr; i++) {
		Answer = max(Answer, dp[X[i] - lx][Y[i] - ly][Z[i] - lz] - i);
	}
	for (int i = 0; i <= hx; i++) {
		for (int j = 0; j <= hy; j++) {
			for (int k = 0; k <= hz; k++) dp[i][j][k] = 0;
		}
	}
	return Answer;
}

int main() {
	// Step 1. Input
	scanf("%d", &N);
	for (int i = 0; i < N; i++) scanf("%d", &A[i]);

	// Step 2. Solve
	for (int i = 0; i < N; i += BACKET) {
		int cl = i;
		int cr = min(N, i + BACKET);
		for (int j = 0; j < 4; j++) Answer[j] = max(Answer[j], Solve(cl, cr, j));
	}

	// Step 3. Naive Solve
	for (int i = 0; i < N; i++) {
		int cnt[4] = {0, 0, 0, 0};
		for (int j = i; j < min(N, i + BACKET + 1); j++) {
			cnt[A[j]] += 1;
			if (cnt[0] > cnt[1] && cnt[0] > cnt[2] && cnt[0] > cnt[3]) Answer[0] = max(Answer[0], j - i + 1);
			if (cnt[1] > cnt[2] && cnt[1] > cnt[3] && cnt[1] > cnt[0]) Answer[1] = max(Answer[1], j - i + 1);
			if (cnt[2] > cnt[3] && cnt[2] > cnt[0] && cnt[2] > cnt[1]) Answer[2] = max(Answer[2], j - i + 1);
			if (cnt[3] > cnt[0] && cnt[3] > cnt[1] && cnt[3] > cnt[2]) Answer[3] = max(Answer[3], j - i + 1);
		}
	}

	// Step 4. Output
	cout << Answer[0] << " " << Answer[1] << " " << Answer[2] << " " << Answer[3] << endl;
	return 0;
}