#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 25
#define M 13
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int lowbit(int x)
{
	return x&(-x);
}
int n,Base,rst,a[N+1],delta[1<<N],minn[1<<N],ans=inf;
bool used[1<<N];
vector<int>p[1<<M];
vector<int>p2[1<<M];
int calc(int x,int y,int z)
{
	return max(max(x,y),z)-min(min(x,y),z);
}
int main()
{
	int d,d2,ps;
	n=read(),Base=n>>1,minn[0]=inf;
	for (int i=1;i<=n;++i) a[i]=read(),delta[1<<(i-1)]=minn[1<<(i-1)]=a[i];
	for (int i=0;i<(1<<n);++i) delta[i]=delta[i-lowbit(i)]+delta[lowbit(i)],minn[i]=min(minn[i-lowbit(i)],minn[lowbit(i)]);
	for (int i=0;i<(1<<n);++i)
		if (delta[i]*3>=delta[(1<<n)-1]&&(delta[i]-minn[i])*3<delta[(1<<n)-1])
			used[i]=1;
	for (int i=0;i<(1<<Base);++i)
	{
		for (int j=i;j>0;j=(j-1)&i) p[i].push_back(delta[j]);
		p[i].push_back(0),sort(p[i].begin(),p[i].end());
	}
	for (int i=0;i<(1<<(n-Base));++i)
	{
		for (int j=i;j>0;j=(j-1)&i) p2[i].push_back(delta[j<<Base]);
		p2[i].push_back(0),sort(p2[i].begin(),p2[i].end());
	}
	for (int i=0;i<(1<<Base);++i)
		for (int j=0;j<(1<<(n-Base));++j)
			if (used[((1<<n)-1)^i^(j<<Base)])
			{
				d=delta[i|(j<<Base)],d2=delta[(1<<n)-1]-d,ps=-1;
				if (calc(d>>1,((d+1)>>1),d2)<ans)
				{
					for (int k=(int)(p[i].size())-1;k>=0;--k)
					{
						while (ps+1<p2[j].size()&&p[i][k]+p2[j][ps+1]<=(d>>1)) ++ps;
						if (calc(p[i][k]+p2[j][ps],d-(p[i][k]+p2[j][ps]),d2)<ans) ans=calc(p[i][k]+p2[j][ps],d-(p[i][k]+p2[j][ps]),d2),rst=i|(j<<Base);
					}
				}
			}
	for (int i=0;i<(1<<n);++i)
		if ((rst&i)==i&&calc(delta[i],delta[rst^i],delta[((1<<n)-1)^rst])==ans)
		{
			for (int j=1;j<=n;++j)
			{
				if ((i>>(j-1))&1) printf("1 ");
				else if (((rst^i)>>(j-1))&1) printf("2 ");
				else printf("3 ");
			}
			puts("");
			return 0;
		}
	return 0;
}