from collections import deque
U = 3 * 10 ** 5
Usq = int(U ** 0.5 + 0.5)
sq = [(i, i * i) for i in range(1, Usq)]
od = sq[0::2]
ev = sq[1::2]

dp = [U] * (U + 1)
prev = [-1] * (U + 1)  # p*pマス戻る、-1ならおわり
for i, s in sq:
    prev[s] = i
    dp[s] = i
    
for i in range(1, U + 1):
    for j, s in ev:
        if s > i:
            break
        if dp[i] >= dp[i - s] + j:
            dp[i] = dp[i - s] + j
            prev[i] = j
    for j, s in od:
        if s > i:
            break
        if dp[i] > dp[i - s] + j:
            dp[i] = dp[i - s] + j
            prev[i] = j

N = int(input())
seq = []
i = N
while i:
    p = prev[i]
    seq.append(p)
    i -= p * p

seq.sort()
odd = []
even = []
for s in seq:
    if s % 2 == 0:
        even.append(s)
    else:
        odd.append(s)

ans = []
for s in odd:
    bit = "".join(["0" if i % 2 == 0 else "1" for i in range(s)])
    ans.append(bit)

even = deque(even)
rev = 0
while even:
    if rev:
        s = even.popleft()
    else:
        s = even.pop()
    bit = "".join(["0" if i % 2 == 0 else "1" for i in range(s)])
    if rev:
        bit = bit[::-1]
    ans.append(bit)
    rev = 1 - rev

print("".join(ans))