def check(l):
    zcount = len([z for z in l.split(" ") if z == "0"])
    onecount = len([z for z in l.split(" ") if z == "1"])

    return int(pow(2, zcount) * onecount * (onecount - 1) / 2)

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):
        p2set[n] = count
        n *= 2
        count += 1

    zcount = 0
    if N % 2 == 0:
        for n, d in sorted(p2set.items(), reverse=True):
            if N % n == 0:
                N /= n
                if N % 2 == 0 or N == 1:
                    zcount = d
                else:
                    zcount = d - 1
                    N *= 2
                break
    else:
        zcount = 0

    N = int(N)
    onecount = 2
    if N > 2:
        comb = int(combi2(onecount))
        while(comb != N):
            onecount += 1
            comb = int(combi2(onecount))

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

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