def combi2(c):
    return c * (c-1) / 2

def solve(N):
    if N == 0:
        return [1, "0"]

    max = 1000000000
    p2set = {}
    n = 1
    count = 0
    while (n < max):
        n *= 2
        count += 1
        p2set[n] = count

    if N not in p2set:
        onecount = 2
        comb = int(combi2(onecount))
        while(True):
            if N / comb == 1 or int(N / comb) in p2set:
                break
            onecount += 1
            comb = int(combi2(onecount))
        N = int(N/comb)
    else:
        onecount = 2

    zcount = 0
    while (N != 1):
        zcount += 1
        N /= 2

    return [zcount + onecount, " ".join(["0"] * zcount + ["1"] * onecount)]

if __name__ == "__main__":
    [print(a) for a in solve(int(input()))]