from math import comb

def solve(N):
    cnt = 0
    tmp = 0
    d = 2
    while N > cnt + tmp:
        cnt += tmp
        tmp = 0
        d += 1
        for i in range(d//3):
            tmp += comb(d - 1,d - 3 * (i + 1))
    t = N - cnt
    for j in range(1 << (d-1)):
        tmp = []
        if (j.bit_count() + 1) % 3 == 0:
            t -= 1
            if t == 0:
                break
    X = ["3","5"]
    for i in range(d - 1):
        tmp.append(X[j & 1])
        j >>= 1
    return "".join(tmp[::-1]) + "5"

print(solve(int(input())))