111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1

n = input()
a = []
for i in range(1100001):
    temp = i
    no=0
    while temp>0:
        if(temp%10!=0 and temp%10!=1):
            no=1
        temp/=10
    if no==0 :
        a.append(i)
mem = [10000050]*1000005
mem[0]=0
back = [0]*1000005
p=0
for i in range(65):
    print a[i]
for i in range(n+1):
   j=0
   while(i-a[j]>=0 and j<66):
       if(mem[i]>mem[i-a[j]]):
           mem[i]=mem[i-a[j]]+1
           back[i]=i-a[j];
       j+=1;
print mem[n]
while(n>0):
    print n-back[n],
    n=back[n]
