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

import sys
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))


def quasibinary_repr(num):

    result = []
    quasibinary_nums = []

    # generate quasi binary numbers
    cur_num = 0
    cur_quasi_num = 0

    while cur_quasi_num < num:
        cur_num = cur_num + 1
        cur_quasi_num = int(bin(cur_num)[2:])

        quasibinary_nums.append(cur_quasi_num)

    quasibinary_nums = list(reversed(quasibinary_nums))

    # subtract largest quasibinary number from current
    while num > 0:

        # find largest quasibinary number
        for i in range(len(quasibinary_nums)):
            if quasibinary_nums[i] <= num:
                break

        num = num - quasibinary_nums[i]
        result.append(quasibinary_nums[i])

    return result
#
# for i in range(9,20):
#
#     result = quasibinary_repr(i)
#     print(i)
#     print(*result, sep=" ")
#     print()



num = inp()
result = quasibinary_repr(num)
print(len(result))
print(*result, sep=" ")




