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 = int(input())
arr = [1]
for x in arr:
    z = x * 10
    if z <= n:
        arr.append(z)
    z += 1
    if z <= n:
        arr.append(z)

dp = [10 ** 9] * (n + 1)
last = [-1] * (n + 1)
dp[0] = 0
for i in range(n):
    for x in arr:
        if i + x <= n:
            if dp[i + x] > dp[i] + 1:
                dp[i + x] = dp[i] + 1
                last[i + x] = x
x = n
ans = []
while x > 0:
    ans.append(str(last[x]))
    x -= last[x]
print(len(ans))
print(' '.join(ans[::-1]))