#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v)                              \
    for (int64_t i = 0; i < (v).size(); ++i) \
    {                                        \
        cout << v.at(i) << endl;             \
    }
#define REP(i, n) for (int64_t i = 0; i < n; ++i)
#define FOR(i, r, n) for (int64_t i = (r); i < n; ++i)
#define VIN(v)                               \
    for (int64_t i = 0; i < (v).size(); ++i) \
    {                                        \
        cin >> (v).at(i);                    \
    }
 
typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal> palvec;
 
typedef vector<vector<bool> > bmat;
typedef vector<vector<int> > imat;
typedef vector<vector<long long> > lmat;
 
typedef vector<string> svec;
typedef vector<vector<string> > smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
 
ll gcd(ll x, ll y)
{
    ll r = x % y;
    if (r == 0)
        return y;
    else
        return gcd(y, r);
}
 
ll lcm(ll x, ll y)
{
    return x * y / gcd(x, y);
}
 
lvec mfactor(ll n)
{
    bvec ip(n, true);
    lvec mf(n, -1);
    ip[0] = false;
    ip[1] = false;
    mf[0] = 0;
    mf[1] = 1;
    REP(i, n)
    {
        if (ip[i])
        {
            mf[i] = i;
            for (ll j = i * i; j < n; j += i)
            {
                ip[j] = false;
                if (mf[j] == -1)
                    mf[j] = i;
            }
        }
    }
    return mf;
}
 
palivec get_prime(ll n, const lvec &mf)
{
    palivec plist;
    while (n != 1)
    {
        int cnt = 0;
        ll m = mf[n];
        while (mf[n] == m)
        {
            cnt++;
            n /= m;
        }
        plist.pb(pali(m, cnt));
    }
    return plist;
}
 
void COMinit(int m, lvec &fac, lvec &finv)
{
    lvec inv(m);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < m; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
 
    }
}
 
ll pow_mod(ll a, ll n)
{
    ll x = 1;
    while (n > 0)
    {
        if (n & 1)
        {
            x = x * a % MOD;
        }
        a = a * a % MOD;
        n >>= 1;
    }
    return x;
}
 
 
ll COM(int n, int k, const lvec &fac, const lvec &finv)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;
}
 
ll modinv(ll a, ll m)
{
    ll b = m, u = 1, v = 0;
    while (b)
    {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

// union by size + path having
class UnionFind {
public:
    vector <ll> par; // 各元の親を表す配列
    vector <ll> siz; // 素集合のサイズを表す配列(1 で初期化)

    // Constructor
    UnionFind(ll sz_): par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i; // 初期では親は自分自身
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);  // resize だとなぜか初期化されなかった
        for (ll i = 0; i < sz_; ++i) par[i] = i; // 初期では親は自分自身
    }

    // Member Function
    // Find
    ll root(ll x) { // 根の検索
        while (par[x] != x) {
            x = par[x] = par[par[x]]; // x の親の親を x の親とする
        }
        return x;
    }

    // Union(Unite, Merge)
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        // merge technique（データ構造をマージするテク．小を大にくっつける）
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) { // 連結判定
        return root(x) == root(y);
    }

    ll size(ll x) { // 素集合のサイズ
        return siz[root(x)];
    }
};

ll order(ll x){
    ll n = floor(log10(x)) + 1;
    string s;
    for (int i=0; i<n; ++i){
        s.pb((char)('0' + (x%10)));
        x/=10;
    }
    reverse(s.begin(), s.end());
    vector<lmat> dp(n+1, lmat(2, lvec(11, 0)));    
    dp[0][1][10]=1;
    for (int i=1; i<=s[0]-'0'; i++){
        int nj = i < s[0]-'0' ? 1 : 0;
        dp[0][nj][i] = 1;
    }
    for (int i=0; i<n-1; i++){
        int v = s[i+1] - '0';
        dp[i+1][1][10] += dp[i][1][10];
        for (int j=1; j<10; j++){
            dp[i+1][1][j] += dp[i][1][10];
        }
        for (int j=0; j<2; j++){
            int lim = j==0 ? v : 9;
            for (int k=0; k<lim+1; k++){
                int nj = j || k < lim;
                if(nj){
                    dp[i+1][nj][k] += dp[i][j][k];
                    if(k<9) dp[i+1][nj][k] += dp[i][j][k+1];
                    if(k>0) dp[i+1][nj][k] += dp[i][j][k-1];
                }
                else{
                    // cout << k << endl;
                    // cout << dp[i][j][k] << ' ' << dp[i][j][k+1] << ' ' << dp[i][j][k-1] << endl;
                    dp[i+1][nj][k] += dp[i][j][k];
                    if(k<9) dp[i+1][nj][k] += dp[i][j][k+1];
                    if(k>0) dp[i+1][nj][k] += dp[i][j][k-1];
                }
            }
        }
    }
    ll res=0;
    for (ll i=0; i<10; i++){
        // cout << n << ' ' << i << ' ' << dp[n-1][0][i] << ' ' << dp[n-1][1][i] << endl;
        res += dp[n-1][0][i] + dp[n-1][1][i];
    }
    return res;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll k;
    cin >> k;
    ll ng = 1ll << 60;
    ll ok = 0;
    
    while(ng-ok > 1){
        ll t = (ng+ok)/2;
        ll nl = order(t);
        //cout << t << ' ' << nl << endl;
        if(nl>k-1) ng = t;
        else ok = t;
    }
    cout << ok+1 << endl;
}


Measured memory_bytes: 640