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 check_quasi_binary(number):
    number_str = str(number)
    result = True
    for char in number_str:
        if not (char == '0' or char == '1'):
            result = False
            break
    return result

def find_max_quasi_binary(number):
    # for n in reversed(range(1, number + 1)):
    #     if check_quasi_binary(n):
    #         return n
    number_str = str(number)
    result = ''
    for char in number_str:
        if char != '0':
            result += '1'
        else:
            result += '0'
    return int(result)


n = int(input())

quasi_binary_sum = []

while n > 0:
    max_quasi_binary = find_max_quasi_binary(n)
    quasi_binary_sum.append(max_quasi_binary)
    n -= max_quasi_binary

print(len(quasi_binary_sum))
print(' '.join([str(x) for x in sorted(quasi_binary_sum)]))
