import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from collections import defaultdict

n = II()
dp = [0]*(n+1)

ii = [[] for _ in range(10)]
ans = [1]*(n+1)
ans[0] = 0

for i in range(1, n):
    if ans[i] == ans[i-1]: ans[i] += 1
    a = ans[i]
    for j in ii[a]:
        if i+j > n: break
        ans[i+j] = max(ans[i+j], a+1)
    ii[a].append(i)

print(*ans[1:], sep="")