#!/usr/bin/python2
# -*- coding: utf-8 -*-
# †
def cmp(x, y):
    if x < y:
        return 0
    if x == y:
        return 1
    return 2

def f(x):
    a = map(int, str(x))
    n = len(a)
    # dp[未満/丁度/超過][leading0][15でのあまり] := パターン数
    dp = [[[0] * 15 for _ in xrange(2)] for _ in xrange(3)] # dp[3][2][15]
    dp[1][0][0] = 1
    for i in reversed(xrange(n)):
        ndp = [[[0] * 15 for _ in xrange(2)] for _ in xrange(3)] # ndp[3][2][15]
        for flag in xrange(3):
            for leading0 in xrange(2):
                for rem in xrange(15):
                    if dp[flag][leading0][rem] == 0:
                        continue
                    for d in [0, 3, 5]:
                        if leading0 and d != 0:
                            continue
                        nflag = cmp(d, a[i])
                        if nflag == 1:
                            nflag = flag
                        nrem = (rem + pow(10, n-1-i, 15) * d) % 15
                        ndp[nflag][d == 0][nrem] += dp[flag][leading0][rem]
        dp = ndp
    res = 0
    for flag in xrange(2):
        for leading0 in xrange(2):
            res += dp[flag][leading0][0]
    return res - 1



def g(n):
    lo, hi = 0, 2**100
    while hi - lo > 1:
        md = (lo + hi) / 2
        if f(md) < n:
            lo = md
        else:
            hi = md
    return hi


n = int(raw_input())
res = g(n)
print res