import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

def Bisect_Int(ok,ng,is_ok):
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        if is_ok(mid):
            ok=mid
        else:
            ng=mid
    return ok

def circle(N):
    cir=[1,0,0,0,1,0,1,0,2,1]
    N=list(map(int,list(str(N))))
    dp=0
    cnt=0
    for i in range(1,N[0]):
        dp+=cir[i]
        cnt+=1
    cur=cir[N[0]]
    for n in N[1:]:
        dp*=10
        dp+=sum(cir)*cnt
        cnt*=10
        for i in range(1,10):
            dp+=cir[i]
            cnt+=1
        for i in range(n):
            dp+=cur+cir[i]
            cnt+=1
        cur+=cir[n]
    return dp

K=int(readline())
def is_ok(N):
    return circle(N+1)<=K
ans=Bisect_Int(1,1<<60,is_ok)
if circle(ans+1)!=K:
    ans=-1
print(ans)