from collections import deque
INF = 2 ** 60
def get_priority(length):
    if length % 2 == 1:
        return length
    else:
        return INF - length
n = int(input())
dp = [INF] * (n+1)
dp[0] = 0
for i in range(1, n+1):
    j = 1
    while True:
        val = j * j
        if val > i:
            break
        dp[i] = min(dp[i], dp[i-val]+j)
        j += 1
use_lengths = []
target = n
while target > 0:
    cands = []
    for i in range(1, n+1):
        val = i * i
        if val > target:
            break
        if dp[target-val]+i == dp[target]:
            cands.append(i)
    cands.sort(key=lambda v: get_priority(v))
    use_lengths.append(cands[0])
    target -= cands[0] * cands[0]
use_lengths.sort(key=lambda v: get_priority(v))
odds = [v for v in use_lengths if v % 2 == 1]
evens = deque([v for v in use_lengths if v % 2 == 0])
result = ""
for v in odds:
    result += "0" + "10" * (v//2)
limit = len(evens)
for i in range(limit):
    if i % 2 == 0:
        result += "01" * (evens.popleft()//2)
    else:
        result += "10" * (evens.pop()//2)
print(result)