from collections import *

def calc(x):
    x = str(x)
    l = len(x)
    dp1 = [[[0]*2 for _ in range(2)] for _ in range(l+1)]
    dp1[0][0][0] = 1
    dp2 = [[[0]*2 for _ in range(2)] for _ in range(l+1)]
    
    for i in range(l):
        d = int(x[i])
        
        for j in range(2):
            for k in range(2):
                for n in range(10 if k else d+1):
                    add = j if n==0 else cnt[n]
                    dp1[i+1][j|(n>0)][k|(n<d)] += dp1[i][j][k]
                    dp2[i+1][j|(n>0)][k|(n<d)] += dp2[i][j][k]+dp1[i][j][k]*add
    
    return dp2[l][0][0]+dp2[l][1][0]+dp2[l][1][1]

def binary_search():
    l, r = 0, 10**18
    
    while l<=r:
        m = (l+r)//2
        
        if calc(m)>=K:
            r = m-1
        else:
            l = m+1
    
    return l

K = int(input())
cnt = defaultdict(int)
cnt[4] = 1
cnt[6] = 1
cnt[8] = 2
cnt[9] = 1
x = binary_search()

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