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

"""

created by huash06 at 2015-05-19


"""
__author__ = 'huash06'

import os
import sys
import functools
import collections
import itertools
import math

class Solution:
    def __init__(self):
        self.N = 0

    def readInput(self):
        self.N = input()

    def readMockInput(self):
        pass

    def solve(self):

        # bits = int(math.log10(self.N))
        # a = self.N
        # b = int(math.pow(10, bits))
        # res = []
        # while a > 0:
        #     res.extend([b] * (a // b))
        #     a %= b
        #     b //= 10
        # print(' '.join(list(map(str, res))))
        num = list(map(int, self.N))
        res = []
        while num.count(0) < len(num):
            tmp = ''
            for i in range(len(num)):
                if num[i] > 0:
                    num[i] -= 1
                    tmp += '1'
                else:
                    if len(tmp) > 0:
                        tmp += '0'
            res.append(tmp)
        print(len(res))
        print(' '.join(res))



s = Solution()
s.readInput()
# s.readMockInput()
s.solve()