#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


bool check(ll x, int k) {
    string s = to_string(x);
    int n = s.size();
    vector<vll> dp(n, vll(10, vl(2)));
    for (int i = 1; i < s[0] - '0'; i++) {
        dp[0][i][0] = 1;
    }
    dp[0][s[0] - '0'][1] = 1;

    for (int i = 1; i < n; i++) {
        for (int j = 1; j < 10; j++) {
            dp[i][j][0] = 1;
        }
    }

    rep (i, n - 1) {
        rep (j, 10) {
            rep (k, 2) {
                for (int add = -1; add <= 1; add++) {
                    int nj = j + add;
                    if (not in(nj, 0, 10)) continue;
                    int nk = 0;
                    if (k == 1 and nj == s[i + 1] - '0') nk = 1;
                    else if (k == 1 and nj > s[i + 1] - '0') continue;
                    dp[i + 1][nj][nk] += dp[i][j][k];
                }
            }
        }
    }
    ll ans = 0;
    rep (i, 10) {
        rep (k, 2) {
            ans += dp[n - 1][i][k];
        }
    }

    //DEBUG(pll(x, ans));
    if (ans >= k) return true;
    else return false;
}

signed main() {
    fio();
    ll k;
    cin >> k;
    ll ok = 1e17, ng = 0;
    while (ng + 1 < ok) {
        ll mid = (ng + ok) / 2;
        if (check(mid, k)) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}

Measured memory_bytes: 256