#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------

//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //------------------------------
    ll kk;cin>>kk;
    map<ll,ll>m;
    ll cnt=1;
    V<ll>use;
    for(ll i=0;i<=9;i++){
        use.pb(i);
        m[i]++;
    }
    cnt=2;
    for(ll i=1;i<=9;i++){
        for(ll j=0;j<=9;j++){
            if(abs(i-j)<=1){
                use.pb(i*10+j);
                m[i*10+j]++;
            }
        }
    }
    for(ll k=1;k<=9;k++){
        for(ll i=0;i<=9;i++){
        for(ll j=0;j<=9;j++){
            if(abs(i-j)<=1&&abs(k-i)<=1){
                use.pb(k*100+i*10+j);
                m[k*100+i*10+j]++;
            }
        }
    }
    }
    cnt=3;
    sort(all(use));reverse(all(use));
    while(cnt<10){
        for(ll i=0;i<use.size();i++){
            //if(use[i]<pow(10,cnt-1))break;

            ll fir=use[i]/pow(10,cnt-1);
            for(ll k=fir-1;k<=fir+1;k++){
                if(k<1||k>9)continue;
                ll tmp=k*pow(10,cnt)+use[i];
                string s=to_string(tmp);
                bool aabc=1;
                for(int c=0;c<s.length()-1;c++){
                    if(abs(s[c]-s[c+1])>1){
                        aabc=0;
                        break;
                    }
                }
                if(aabc==0)continue;
                if(m[tmp]==0){
                    use.pb(tmp);
                    m[tmp]++;
                }
            }
        }
        cnt++;
        sort(all(use));reverse(all(use));
    }
    sort(all(use));

    cout<<use[kk]<<endl;
    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------













































Measured memory_bytes: 14960