def main():
    import sys
    C = sys.stdin.read().strip()
    L = len(C)

    def sum_bits(n):
        s = 0
        m = 0
        while (1 << m) <= n:
            start = 1 << m
            end = min((1 << (m + 1)) - 1, n)
            count = end - start + 1
            s += count * (m + 1)
            m += 1
        return s

    low = 1
    high = 1 << 20  # A sufficiently large upper bound
    N = -1
    while low <= high:
        mid = (low + high) // 2
        sb = sum_bits(mid)
        if sb == L:
            N = mid
            break
        elif sb < L:
            low = mid + 1
        else:
            high = mid - 1

    if N == -1:
        print("Not found")
        return

    bin_strings = {}
    for x in range(1, N + 1):
        bs = bin(x)[2:]
        bin_strings[bs] = x

    used = [False] * (N + 1)
    result = []

    def backtrack(pos):
        if pos == L:
            return True
        for x in range(1, N + 1):
            if not used[x]:
                bs = bin(x)[2:]
                l = len(bs)
                if pos + l > L:
                    continue
                if C[pos:pos + l] == bs:
                    used[x] = True
                    result.append(x)
                    if backtrack(pos + l):
                        return True
                    result.pop()
                    used[x] = False
        return False

    if backtrack(0):
        print(' '.join(map(str, result)))
    else:
        print("No solution found")

if __name__ == "__main__":
    main()