#include<bits/stdc++.h>
#define rep(i,n) for(int i=1;i<=n;++i)
#define st first
#define nd second
using namespace std;
typedef long long ll;
typedef pair<int,int> pr;
const int N=30;
int a[N],n;
int dp[1<<25],to[1<<25],sum=0;
int ot[N];
int main() {
    scanf("%d",&n);
    //n=20;
    rep(i,n){
        scanf("%d",a+i);
        //a[i]=i*i;
        sum+=a[i];
    }
    for(int mk=1;mk<1<<n;++mk){
        dp[mk]=sum;
        for(int j=0;j<n;++j)if(mk&(1<<j)){
            int now=dp[mk-(1<<j)];
            if(now<0)now+=a[j+1];else now-=a[j+1];
            if(abs(now)<abs(dp[mk])){
                dp[mk]=now;
                to[mk]=j;
            }
        }
    }
    int ans=sum+1,is=0;
    for(int mk=0;mk<1<<n;++mk){
        int s=0;
        for(int j=0;j<n;++j)if(mk&(1<<j))
            s+=a[j+1];
        int u=s,v=(sum-s-dp[(1<<n)-1-mk])/2,w=(sum-s+dp[(1<<n)-1-mk])/2;
        int nw=max(abs(u-v),max(abs(v-w),abs(w-u)));
        if(ans>nw){
            ans=nw;
            is=(1<<n)-1-mk;
        }
    }
    for(int j=0;j<n;++j)if(!(is&(1<<j)))ot[j+1]=3;
    while(is>0){
        int nxt=is-(1<<to[is]);
        ot[to[is]+1]=(dp[nxt]<0?1:2);
        is=nxt;
    }
    //printf("%d\n",ans);
    rep(i,n)printf("%d%c",ot[i]," \n"[i==n]);
    return 0;
}
/*
20
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
 */