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

# Description of the problem can be found at http://codeforces.com/problemset/problem/538/B

n = int(input())

d_n = {}

t_n = n
m = 0
i = 0
while t_n > 0:
    i = max(1, i * 10)
    d_n[i] = t_n % 10
    t_n //= 10
    m = max(d_n[i], m)

print(m)
for _ in range(m):
    t_i = i
    o = 0
    while t_i > 0:
        o *= 10
        o += 1 if d_n[t_i] > 0 else 0
        d_n[t_i] -= 1
        t_i //= 10
    print(o, end = " ")