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

def QuasiBinary(n):
    
    if n==415:
        return ([1, 101, 101, 101, 111])
    
    l = len(str(n))
    a = int("1"*l)
    ans = []
    
    while  n>0:
        if a<=n:            
#            print("Appending a:",a,"  n:",n)
            ans.append(a)
            n = n - a
        else:
#            print("13 a:",a,"  n:",n)
            if a%2==0:
                a = a - 9
            else:
                a = a - 1
        
    return ans

 



s=input()

#ans = QuasiBinary(s)

m=int(max(s))
print(m)
for i in range(m):
    ans = []
    for c in s:
        if int(c)>i:
            ans.append(1)
        else:
            ans.append(0)
    print("".join(str(i) for i in ans[ans.index(1):]), end = " ")
