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 os,sys

def do_processing(elements):

    k = int(raw_input().rstrip())
    output = []

    while True:
        for ele in elements:
            if k >= ele:
                output.append(str(ele))
                k -= ele
                break
        if k <= 0:
            break
    output.sort()
    print len(output),"\n",' '.join(output)



if __name__ == '__main__':

    # elements = []
    # for i in range(1000001):
    #     dist_ele = ''.join(set(str(i)))
    #     if dist_ele == '0' or dist_ele == '1' or dist_ele == '01' or dist_ele == '10':
    #         elements.append(i)
    # print elements

    elements = [1000000, 111111, 111110, 111101, 111100, 111011, 111010, 111001, 111000, 110111, 110110, 110101, 110100, 110011, 110010, 110001, 110000, 101111, 101110, 101101, 101100, 101011, 101010, 101001, 101000, 100111, 100110, 100101, 100100, 100011, 100010, 100001, 100000, 11111, 11110, 11101, 11100, 11011, 11010, 11001, 11000, 10111, 10110, 10101, 10100, 10011, 10010, 10001, 10000, 1111, 1110, 1101, 1100, 1011, 1010, 1001, 1000, 111, 110, 101, 100, 11, 10, 1, 0]

#    elements.sort(reverse=True)
    #print elements
    do_processing(elements)