#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define OVERFLOW -1
#define MAX_TREE_SIZE 100
typedef int Status;
typedef struct {
        unsigned int weight;
        unsigned int parent,lchild,rchild;
}HTNode,*HuffmanTree; 
typedef char **HuffmanCode; 
int min1(HuffmanTree t,int i) { 
        int j,flag;
        unsigned int k=UINT_MAX; 
        for(j=1;j<=i;j++)
                if(t[j].weight<k&&t[j].parent==0)
                        k=t[j].weight,flag=j;
        t[flag].parent=1;
        return flag;
}

void select(HuffmanTree t,int i,int *s1,int *s2) {
        int j;
        *s1=min1(t,i);
        *s2=min1(t,i);
        if(*s1>*s2) {
                j=*s1;
                *s1=*s2;
                *s2=j;
        }
}

void HuffmanCoding(HuffmanTree *HT,HuffmanCode *HC,int *w,int n) { 
        int m,i,s1,s2,start;
        unsigned c,f;
        HuffmanTree p;
        char *cd;
        if(n<=1) return;
        m=2*n-1;
        *HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));
        for(p=*HT+1,i=1;i<=n;++i,++p,++w) {
                (*p).weight=*w; (*p).parent=(*p).lchild=(*p).rchild=0;
        }
        for(;i<=m;++i,++p) (*p).parent=0;
        for(i=n+1;i<=m;++i) { 
                select(*HT,i-1,&s1,&s2);
                (*HT)[s1].parent=(*HT)[s2].parent=i;
                (*HT)[i].lchild=s1;
                (*HT)[i].rchild=s2;
                (*HT)[i].weight=(*HT)[s1].weight+(*HT)[s2].weight;
        }
        *HC=(HuffmanCode)malloc((n+1)*sizeof(char*));
        cd=(char*)malloc(n*sizeof(char)); 
        cd[n-1]='\0'; 
        for(i=1;i<=n;i++) {
                start=n-1;
                for(c=i,f=(*HT)[i].parent;f!=0;c=f,f=(*HT)[f].parent)
                if((*HT)[f].lchild==c) cd[--start]='0';
                else cd[--start]='1';
                (*HC)[i]=(char*)malloc((n-start)*sizeof(char));
                strcpy((*HC)[i],&cd[start]);
        }
        free(cd); 
}

int main() {
        HuffmanTree HT;
        HuffmanCode HC;
        int *w,n,i,c;
        scanf("%d",&n);
        c=n;
        w=(int*)malloc(n*sizeof(int));
        for(i=0;i<=n-1;i++)
                scanf("%d",w+i);
        HuffmanCoding(&HT,&HC,w,n);
        while(n--) puts(HC[c-n]);
        return 0;
}
/**************************************************************
	Problem: 2158
	User: admin
	Language: C
	Result: Accepted
	Time:9 ms
	Memory:1144 kb
****************************************************************/