struct S:std::array<int,7>{};

ll e[19];
ll g;

void f(ll d,set<S>&a,ll o){
	if(d<0){
		ll t=0;
		rrep(i,19){
			if(t+=e[i]){
				wtN(e[i]);
			}
		}
		exit(0);
	}else{
		for(;e[d]<10;++e[d]){
			g|=e[d];
			if(!(o&1<<e[d])){
				if(g){
					bool q=d&&!e[d-1];
					static const ll t1[]={
						0b1110111,
						0b0010010,
						0b1011101,
						0b1011011,
						0b0111010,
						0b1101011,
						0b1101111,
						0b1010010,
						0b1111111,
						0b1111011,
					};
					ll p1=t1[e[d]];
					static const ll t2[]={
						0b0001111,
						0b0100100,
						0,
						0,
						0,
						0,
						0b0101111,
						0b1110010,
						0,
						0b1111010,
					};
					ll p2=t2[e[d]];
					set<S> b;
					for(auto x:a){
						if(p1){
							S y;
							ll mn=19,mx=0;
							rep(i,7){
								y[i]=x[i];
								if(p1&1<<i){
									y[i]+=1;
								}
								mn<?=y[i];
								mx>?=y[i];
							}
							if(mx-mn<d+1){
								b.insert(y);
							}
						}
						if(p2){
							S y;
							ll mn=19,mx=0;
							rep(i,7){
								y[i]=x[i];
								if(p2&1<<i){
									y[i]+=1;
								}
								mn<?=y[i];
								mx>?=y[i];
							}
							if(mx-mn<d+1){
								b.insert(y);
							}
						}
					}
					if(b.size()){
						f(d-1,b,o);
					}
					if(q){
						o|=1<<e[d];
					}
				}else{
					f(d-1,a,o);
				}
				e[d-1]=0;
			}
		}
	}
}

{
	ll@n;
	rep(i,19){
		e[i]=n%10;
		n/=10;
	}
	S s;
	rep(i,7){
		s[i]=0;
	}
	set<S> b;
	b.insert(s);
	f(18,b,0);
}