import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

def ceil_sqrt(x):
    a = round(x**0.5+0.45)-1
    while a**2 < x: a += 1
    return a

def solve():
    c1=(1+ceil_sqrt(1+8*k))//2
    if c1*(c1-1)==2*k:return c1
    return -1

k=II()

if k==0:
    print(1)
    print(0)
    exit()

c0=0
while k:
    c1=solve()
    if c1!=-1 and c1+c0<=30:
        ans=[1]*c1+[0]*c0
        print(c1+c0)
        print(*ans)
        break
    c0+=1
    k>>=1