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 b(n):
    return int(bin(n).lstrip("0b"))


def p(c):
    for d in c:
        print(d)


def solve(n):
    c = int(len(str(n)) * "1", 2)
    dp = [[-1 for j in range(c+1)] for i in range(n+1)]

    for i in range(n+1):
        for j in range(c+1):
            if i == 0 or j == 0:
                dp[i][j] = []
            elif j == 1:
                dp[i][j] = dp[i-1][j] + [1]
            else:
                if i-b(j) >= 0:
                    if len(dp[i-b(j)][j]) + 1 < len(dp[i][j-1]):
                        dp[i][j] = dp[i-b(j)][j] + [int(bin(j).lstrip("0b"))]
                    else:
                        dp[i][j] = dp[i][j-1] + [int(bin(j).lstrip("0b"))]
                else:
                    dp[i][j] = dp[i][j-1]

    print(len(dp[n][c]))
    print(" ".join(map(str, dp[n][c])))

if __name__ == "__main__":
    num = int(input())
    solve(num)