from math import comb
def solve(N):
    cnt = 0
    tmp = 0
    d = 2
    i = 0
    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 - 1
    X = ["3","5"]
    Y = []
    for j in range(1 << (d-1)):
        tmp = []
        if (j.bit_count() + 1) % 3 == 0:
            for i in range(d-1):
                tmp.append(X[j&1])
                j >>= 1
            Y.append("".join(tmp[::-1]+["5"]))
    Y.sort()
    return Y[t]

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