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 better(a,b): if a&1 and b&1:return ab def chmin(i, a): ni=i+a**2 if dp[i]+a < dp[ni] or (dp[i]+a == dp[ni] and better(a,aa[ni])): dp[ni] = dp[i]+a aa[ni] = a n = II() dp = [inf]*(n+1) aa = [-1]*(n+1) dp[0] = 0 for i in range(n): pre = dp[i] if pre==inf:continue for a in range(1, 1000): if i+a**2 > n: break chmin(i, a) # print(dp[-1]) # print(aa) now = n ans = [0] odd,even=[],[] while now > 0: a = aa[now] if a&1:odd.append(a) else:even.append(a) now -= a**2 odd.sort() even.sort(reverse=True) for d in odd+even: ans.append(ans[-1]) for _ in range(d-1): ans.append(1-ans[-1]) print(*ans[1:], sep="") # print(len(ans))