from collections import *

def main():
    N = int(input())
    M = int(N ** 0.5) + 2
    inf = 10 ** 18
    dp = [inf] * (N + 1)
    dp[0] = 0
    for i in range(N):
        for j in range(1, M + 1):
            nex = i + j * j
            if i + j * j > N:
                break
            dp[nex] = min(dp[nex], dp[i] + j)
    
    L = []
    now = N
    for i in range(1, M, 2):
        while now >= i * i:
            if dp[now] == dp[now - i * i] + i:
                now -= i * i
                L.append(i)
                continue
            else:
                break
    for i in range(2, M, 2):
        while now >= i * i:
            if dp[now] == dp[now - i * i] + i:
                now -= i * i
                L.append(i)
                continue
            else:
                break

    def f(t):
        odd, even = [], []
        for i in range(len(t)):
            if t[i] % 2:
                odd.append(t[i])
            else:
                even.append(t[i])
        odd.sort()
        even.sort()
        even = deque(even)
        cnt = 0
        while even:
            if cnt % 2:
                odd.append(even.popleft())
            else:
                odd.append(even.pop())
            cnt += 1
        lst = []
        now = 0
        for a in odd:
            for i in range(a):
                lst.append(str(now))
                now = 1 - now
            now = 1 - now
        return "".join(lst)

    print(f(L))

main()