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 collections import deque
from itertools import product


class Solver:
    INF = 10 ** 7

    def __init__(self):
        self.d = []
        self.skip = []
        self.n = None
        self.quasis = []

    def bfs(self):
        queue = deque()
        for q in self.quasis:
            self.d[q] = 1
            self.skip[q] = q
            queue.append(q)

        while True:
            if len(queue) == 0 or self.d[self.n] != Solver.INF:
                break
            current = queue.popleft()
            for q in self.quasis:
                number = current + q
                if number > self.n or self.d[number] != self.INF:
                    continue
                self.d[number] = self.d[current] + 1
                self.skip[number] = q
                queue.append(number)

    def track_skip(self):
        res = []
        n = self.n
        while n > 0:
            res.append(self.skip[n])
            n -= self.skip[n]
        return res

    def main(self):
        self.n = int(input().strip())
        self.d = [Solver.INF] * (self.n + 1)
        self.skip = [Solver.INF] * (self.n + 1)
        for quasi_list in product('01', repeat=7):
            number = int(''.join(quasi_list))
            if 0 < number <= self.n:
                self.quasis.append(number)
        self.bfs()
        print(self.d[self.n])
        print(' '.join([str(item) for item in self.track_skip()]))


Solver().main()
