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())
ans = []
a = [1, 0]
perm = []
def permutation(c, r, l, n):
    if len(r) == l:
        value = int("1"+''.join(map(str, r)))
        if value<=n:
            perm.append(value)
    else:
        for i in range(2):
            if c[i]>0:
                c[i] -= 1
                r.append(a[i])
                permutation(c, r, l, n)
                c[i] += 1
                r.pop()
while(n>0):
    t = len(str(n))
    num = int("1"*t)
    if num<=n:
        ans.append(num)
        n -= num
    else:
        i = 1
        perm = []
        while(i<t):
            permutation([t-i-1, i], [], t-1, n)
            if len(perm)!=0:
                ans.append(perm[0])
                n -= perm[0]
                break
            i += 1
print(len(ans))
print(' '.join(map(str, ans)))
