/**   Created by: Humberto Yusta
          Codeforces User: humbertoyusta
          Country: Cuba
          Copyright��                    */
#include<bits/stdc++.h>
using namespace std;
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 200010;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = (((1ll<<59ll)-1ll)*2ll)+1ll;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Template ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long ,  null_type ,  less<long long> ,  rb_tree_tag ,  tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
    if( !e ) return 1;
    if( e & 1 ) return qpow(b,e-1) * b % mod;
    int pwur = qpow(b,e>>1);
    return pwur * pwur % mod;
}
/// My Code -------------------------------------------------

int n, m, sum, ans, dp[11][11], pot[11], ac[11];

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout.setf(ios::fixed); cout.precision(0);
    srand(time(NULL));

    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);

    cin >> n;

    pot[0] = 1;
    for(int i=1; i<=10; i++)
        pot[i] = pot[i-1] * 10;

    for(int i=0; i<10; i++){
        dp[1][i] = 1;
        dp[i+1][10] = 1000000007;
        ac[1] = 9;
    }

    for(int i=2; i<=10; i++){
        for(int j=0; j<10; j++){
            for(int k=max(0ll,j-1); k<=min(9ll,j+1); k++)
                dp[i][j] += dp[i-1][k];
        }
        for(int j=1; j<10; j++)
            ac[i] += dp[i][j];
    }

    int last = -1;
    for(int i=10; i>0; i--){
        for(int j=1; j<=10; j++){
            int b = 0;
            for(int k=j-1; k>0; k--)
                b += dp[i][k];
            for(int l=i-1; l>0; l--)
                b += ac[l];
            if( b + dp[i][j] >= n && b <= n ){
                ans += ( j ) * pot[i-1];
                n -= b;
                int last = j;
                i--;
                for( ; i>0; i--){
                    for(int k=max(0ll,last-1); k<=min(9ll,last+1); k++){
                        if( n <= dp[i][k] ){
                            ans += k * pot[i-1];
                            last = k;
                            break;
                        }
                            n -= dp[i][k];
                    }
                }
                break;
            }
        }
    }

    cout << ans << '\n';

    return 0;
}


Measured memory_bytes: 256