def list3(a, b, c, *, val=0):
    return [[[val] * c for _ in range(b)] for _ in range(a)]


def ndlist(shape: list[int], *, val=0) -> list:
    assert len(shape) > 0 and all(s > 0 for s in shape)

    def rec(p):
        if p == len(shape)-1:
            return [val] * shape[p]

        return [rec(p+1) for _ in range(shape[p])]

    return rec(0)


def digit_dp_sub(n: int, d: int) -> int:
    ds = [int(c) for c in str(n)]
    nd = len(ds)

    dp = ndlist([nd+1, 2, 2, 60])
    #
    # i : i 桁目までみた
    # j : n 未満か(j=0 完全一致 j=1 より小さい)
    # k : leading zero
    # m : 数字 d の出現回数
    dp[0][0][1][0] = 1

    for i in range(nd):
        for j in range(2):
            to = ds[i] if j == 0 else 9
            for k in range(2):  # leading zero
                #fm = 0 if k == 1 else 1
                for m in range(60):
                    if dp[i][j][k][m] == 0: continue

                    for x in range(to+1):
                        nj = j | (x < to)
                        nk = k & (x == 0)
                        nm = m + (not nk and x == d)
                        #if not nk:
                        #    nm += (x == d)

                        dp[i+1][nj][nk][nm] += dp[i][j][k][m]

    res = 0
    for j in range(2):
        for m in range(60):
            # dp[nd][j][0][m] = 数字 d が m 個含む整数の個数
            res += dp[nd][j][0][m] * m

    return res


def digit_dp(n: int) -> int:
    res = 0
    for d, c in [(0, 1), (4, 1), (6, 1), (8, 2), (9, 1)]:
        # t = digit_dp_sub(n, d)
        # print(f'{t=} {d=}')
        res += digit_dp_sub(n, d) * c

    return res


INF = 1 << 60
K = int(input())

lo = 1
hi = INF
while lo <= hi:
    m = (lo + hi) // 2
    res = digit_dp(m)
    if res == K:
        print(m)
        hi = m - 1
        break
    elif res > K:
        hi = m - 1
    else:
        lo = m + 1
else:
    print(-1)