N = int(input())
M = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]

dp = [-1] * (N+1)
dp[0] = 0
for i in range(N):
    if dp[i] == -1:
        continue
    for j, x in enumerate(M):
        if i + x <= N:
            dp[i+x] = max(dp[i+x], dp[i]*10 + j)

print(max(dp[:N+1]))