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

#!/usr/bin/env python2
# -*- coding: utf-8 -*-

## Codeforces Round #300 (div. 2)
## B. Quasi Binary
## tags: r300 p538

try:
    import psyco
    psyco.full()
except ImportError:
    pass


def main(n):
    sol = []
    sn = str(n)

    for p, sk in enumerate(sn):
        k = int(sk)
        for i in xrange(k):
            if p == 0 or len(sol) <= i:
                sol.append('1')
            else:
                sol[i] = sol[i] + '1'
        ls = len(sol) - k
        for i in xrange(ls):
            sol[i + k] = sol[i + k] + '0'

    return sol


if __name__ == "__main__":
    n = int(raw_input())
    sol = main(n)

    print(len(sol))
    print(" ".join(str(k) for k in sol))
