//μ's forever
#include <bits/stdc++.h>
#define N 1000005
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int n;
int val[30];
int p[4];
struct node{
    int x,y,tp,val,id;
}t[N*2];
bool cmp(node a,node b){
    if(a.x==b.x) return a.tp>b.tp;
    return a.x<b.x;
}
int tot;
struct tnode{
    int ls,rs,val,id;
}tr[N*50];
int totn,rt;
void modify(int &x,int l,int r,int pos,int val,int id){
    // if(pos!=0) cerr<<pos;
    if(!x){
        x=++totn;
        tr[x].val=1145141919;
        tr[x].ls=tr[x].rs=0;
    }
    if(val<tr[x].val) tr[x].val=val,tr[x].id=id;
    if(l==r) return;
    int mid=l+r>>1;
    if(pos<=mid) modify(tr[x].ls,l,mid,pos,val,id);
    else modify(tr[x].rs,mid+1,r,pos,val,id);
}
tnode qry(int x,int l,int r,int L,int R){
    // if(x==rt) cerr<<L<<" "<<R<<endl;
    if(!x) return (tnode){0,0,1145141919,0};
    if(L<=l&&r<=R) return tr[x];
    int mid=l+r>>1;
    tnode res=(tnode){0,0,1145141919,0};
    if(L<=mid){
        res=qry(tr[x].ls,l,mid,L,R);
    }
    if(R>mid){
        tnode tmp=qry(tr[x].rs,mid+1,r,L,R);
        if(tmp.val<res.val) res=tmp;
    }
    return res;
}
int ans=1145141919,m1=0,m2=0;
int main()
{
    n=read();
    for(int i=1;i<=n;++i) val[i]=read();
    for(int i=n+1;i<=25;++i) val[i]=0;
    for(int i=1;i<=3;++i) p[i]=i;
    do{
        if(p[1]==1&&p[2]==3&&p[3]==2) continue;
        if(p[1]==3&&p[2]==1&&p[3]==2) continue;
        if(p[1]==3&&p[2]==2&&p[3]==1) continue;
        tot=0;
        for(int i=0;i<531441;++i){
            int v[4],kk=i;
            v[1]=val[1],v[2]=v[3]=0;
            for(int j=2;j<=13;++j){
                v[kk%3+1]+=val[j];
                kk/=3;
            }
            // if(i==371564)cerr<<v[p[1]]-v[p[3]]<<endl;
            t[++tot]=(node){v[p[1]]-v[p[2]],v[p[2]]-v[p[3]],1,v[p[1]]-v[p[3]],i};
            // cerr<<t[tot].val<<endl;
        }
        for(int i=0;i<531441;++i){
            int v[4],kk=i;
            v[1]=v[2]=v[3]=0;
            for(int j=14;j<=25;++j){
                v[kk%3+1]+=val[j];
                kk/=3;
            }
            t[++tot]=(node){v[p[2]]-v[p[1]],v[p[3]]-v[p[2]],2,v[p[1]]-v[p[3]],i};
        }
        sort(t+1,t+1+tot,cmp);
        rt=totn=0;
        for(int i=1;i<=tot;++i){
            if(t[i].tp==1){
                tnode tmp=qry(rt,-250000000,250000000,-250000000,t[i].y);
                if(tmp.val!=1145141919){
                    if(t[i].val+tmp.val<ans){
                        // cerr<<t[i].id<<endl;
                        // cerr<<t[i].val<<" "<<tmp.val<<endl;
                        ans=t[i].val+tmp.val;
                        m1=t[i].id,m2=tmp.id;
                    }
                }
            }else{
                modify(rt,-250000000,250000000,t[i].y,t[i].val,t[i].id);
            }
        }
    }while(next_permutation(p+1,p+4));
    // cerr<<ans<<endl;
    printf("1 ");
    for(int i=2;i<=min(n,13);++i){
        printf("%d ",m1%3+1);
        m1/=3;
    }
    for(int i=14;i<=min(n,25);++i){
        printf("%d ",m2%3+1);
        m2/=3;
    }
    return 0;
}