#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

def solve(K):
    if K == 0:
        return [0]

    for N in range(2, 31):
        for n1 in range(2, N+1):
            n0 = N - n1
            v = (n1 * (n1-1) //2) * (2 ** n0)
            if v == K:
                return [1] * n1 + [0] * n0
    return [-1]



K = int(input())
ans = solve(K)
print(len(ans))
print(*ans)