import sys,random,bisect
from collections import deque,defaultdict
import heapq
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

memo = {}
def calc(n):
    if n in memo:
        return memo[n]
    if n<=0:
        return 0

    """
    1~nまででの丸の数
    1個：4,6,9,0
    2個：8
    """

    res = 0

    for i in (1,2,3,5,7):
        if i <= n%10:
            res += calc(n//10)
        else:
            res += calc(n//10-1)


    for i in (0,4,6,9):
        if i==0:
            res += n//10
        else:
            if i <= n%10:
                res += n//10 + 1
            else:
                res += n//10
        
        if i <= n%10:
            res += calc(n//10)
        else:
            res += calc(n//10-1)
    
    for i in (8,):
        if i <= n%10:
            res += (n//10 + 1) * 2
        else:
            res += (n//10) * 2
        if i <= n%10:
            res += calc(n//10)
        else:
            res += calc(n//10-1)
    
    memo[n] = res
    return res

def calc_brute(n):
    res = [0] * (n+1)
    for i in range(1,n+1):
        s = str(i)
        res[i] = res[i-1]
        for j in ("0","4","6","9"):
            res[i] += s.count(j)
        for j in ("8"):
            res[i] += s.count(j) * 2
    return res



K = int(input())

ok = 10**18
ng = 0
while ok-ng>1:
    mid = (ok+ng)//2
    if calc(mid) >= K:
        ok = mid
    else:
        ng = mid

if calc(ok)==K:
    print(ok)
else:
    print(-1)