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

from sys import stdin as si
from collections import Counter as c
from functools import reduce


class Solution:

    def largest(self,m):
        m = str(m)
        l= '1'
        for i in range(1,len(m)):
            if m[:i+1] >= l+'1':
                l+='1'
            else:
                l+='0'
        return int(l)

    def bazinga(self,a):
        lst, l = [], int('1'*len(str(a)))
        while a > 0:
            if a <= l:
                l = self.largest(a)
            a -=l
            lst.append(l)
        print (len(lst))
        return reduce(lambda x, y: str(x)+' '+str(y), lst) # use reduce


if __name__ == '__main__':
    #for i in range(int(si.readline().strip())):
    #n,m = map(int,si.readline().strip().split())
    #m = list(map(int, si.readline().strip().split()))
    n = int(si.readline().strip())
    S = Solution()
    print(S.bazinga(n))


'''
http://codeforces.com/contest/538/problem/B
'''