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

lis = []


def generate(rem, s):
    if rem == 0:
        return
    lis.append(int(s))
    generate(rem - 1, s + "1")
    generate(rem - 1, s + "0")


def bin_search(n, l, r):
    while l < r:
        mid = (l + r + 1) // 2
        if lis[mid] > n:
            r = mid - 1
        else:
            l = mid
    return lis[l]


generate(7, "1")
lis.append(0)
lis.sort()
# print(lis)
n = int(input())
ans = []
while n > 0:
    temp = bin_search(n, 0, len(lis)-1)
    mul = n // temp
    n -= (mul*temp)
    t1 = [temp]*mul
    #print(mul)
    ans += t1
print(*ans)
