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

import sys

input = sys.stdin.readline


def inp():
    return (int(input()))


def get_binary_num(num):
    return int("{0:b}".format(num))


hash_map = {}


def solve(n):
    if n == 0:
        return []
    if n < 10:
        return [1] * n

    if n in hash_map:
        return hash_map[n]
    l = len(str(n))
    _min = float('inf')
    res = []
    for i in range(int(2 ** l) - 1, int(2 ** (l-1)) - 1, -1):
        binary_num = get_binary_num(i)
        if binary_num > n:
            continue
        r = [binary_num] + solve(n - binary_num)
        if len(r) < _min:
            res = r
            _min = len(r)
    hash_map[n] = res
    return res


if __name__ == '__main__':
    n = inp()
    print(" ".join(map(str, solve(n))))