from itertools import count


def combi(n, mod):
    c = [[0 for i in range(n + 1)] for j in range(n + 1)]
    for x in range(n + 1):
        c[x][0] = 1
        for y in range(1, x + 1):
            c[x][y] = (c[x - 1][y] + c[x - 1][y - 1]) % mod
    return c


def bitcount(x):
    """
    立っているbitの数
    """
    x = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555)
    x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333)
    x = (x & 0x0f0f0f0f0f0f0f0f) + (x >> 4 & 0x0f0f0f0f0f0f0f0f)
    x = (x & 0x00ff00ff00ff00ff) + (x >> 8 & 0x00ff00ff00ff00ff)
    x = (x & 0x0000ffff0000ffff) + (x >> 16 & 0x0000ffff0000ffff)
    return (x & 0x00000000ffffffff) + (x >> 32 & 0x00000000ffffffff)


def out(n, m):
    # n 桁の m 番目
    x = 0
    for i in range((1 << n) + 1):
        if bitcount(i) % 3 == 2:
            x += 1
            if x == m:
                b = bin(i)[2:]
                b = b.replace('0', '3').replace('1', '5')
                print('3' * (n - len(b)) + b, '5', sep='')
                return


def solve():
    N = int(input())

    co = combi(26, 10000007)

    i = 0
    for n in count(2):
        j = i
        for r in range(n - 2, -1, -3):
            i += co[n][r]
        if i >= N:
            out(n, N - j)
            return


if __name__ == '__main__':
    solve()