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()
n1=len(n)
k=0
for i in range(n1):
   if(int(n[i])>k):
      k=int(n[i])

print(k)
l=[]
for i in range(k):
   l.append("")

for i in range(n1):
   for j in range(int(n[i])):
      l[j]+="1"
   for j in range(int(n[i]),k):
      l[j]+="0"

def fix(l):
   l1=len(l)
   p=[]
   for i in range(l1):
      s=0
      if(l[i][0]=="0"):
         j=1
         r=len(l[i])
         s=1
         while(j<r):
            if(l[i][j]=="0"):
               s+=1
            else:
               break
            j+=1
      p.append(s)
   for i in range(l1):
      if(p[i]>0):
         m=""
         r=len(l[i])
         for j in range(p[i],r):
            m+=l[i][j]
         l[i]=m
   return l
fix(l)
for i in range(k):
   print(l[i],"",end="")
if(k==0):
   print(k)









