#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define INF (1LL<<57)
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define whoami(x) cerr<<#x<<" "<<x<<"\n";
#define mp make_pair
#define ins insert
#define sz size

void FLASH() {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
void SETF() {cout.ios_base::setf(ios_base::fixed);}
void UNSETF() {cout.ios_base::unsetf(ios_base::fixed);}

typedef long long ll;
typedef long double ld;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<PII, int> PPII;
typedef pair<PLL, ll> PPLL;
typedef map<int, int> MII;

const int MOD = 1000000007;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

struct h_llint {
  static uint64_t splitmix64(uint64_t x) {    // http://xorshift.di.unimi.it/splitmix64.c
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};

struct h_pair{
  size_t operator()(const PLL&x)const{
    return hash<ll>()(((ll)x.ff)^(((ll)x.ss)<<32));
  }
};

typedef map<ll, ll> MLL;
typedef map<PII, int> MPII;
typedef map<PLL, ll> MPLL;
typedef set<int> SI;
typedef set<ll> SL;
//ordered_set = order_of_key(.)
//ordered_set = find_by_order(.)
typedef ordered_set<int> OSI;
typedef ordered_set<ll> OSL;
typedef ordered_multiset<int> MOSI;
typedef ordered_multiset<ll> MOSL;
typedef unordered_map<ll, int, h_llint> UMLI;
typedef unordered_map<ll, ll, h_llint> UMLL;
typedef unordered_map<PLL, int, h_pair> UMPI;
typedef unordered_map<PLL, ll, h_pair> UMPL;

int ar[MV], memo[10][21], pmemo[10][21];
ll arr[MV];

int xd(int dg, int td)
{
	if(td == 1)
	return 1;
	if(memo[dg][td] != -1)
	return memo[dg][td];
	int res = 0;
	if(!dg)
	res += (xd(dg, td-1) + xd(dg+1, td-1));
	else if(dg == 9)
	res += (xd(dg-1, td-1) + xd(dg, td-1));
	else res += (xd(dg-1, td-1) + xd(dg, td-1) + xd(dg+1, td-1));
	memo[dg][td] = res;
	return res;	
}

int pfxd(int dg, int td)
{
	if(!td)
	return 0;
	if(pmemo[dg][td] != -1)
	return pmemo[dg][td];
	int res = 0;
	if(dg)
	res += xd(dg, td);
	if(dg > 1)
	res += pfxd(dg-1, td);
	else res += pfxd(9, td-1);
	pmemo[dg][td] = res;
	return res; 	
}

int bs1a(int k)
{
	int lo = 1;
	int hi = 20;
	while(lo < hi)
	{
		int mid = lo + (hi - lo)/2;
		if(pfxd(9, mid) >= k)
		hi = mid;
		else lo = mid + 1;	
	}
	return lo;
}

int bs1b(int pos, int k)
{
	int lo = 0;
	int hi = 9;
	while(lo < hi)
	{
		int mid = lo + (hi - lo)/2;
		if(pfxd(mid, pos) >= k)
		hi = mid;
		else lo = mid + 1;	
	}
	return lo;
}

void solve(int T)
{
	memset(memo, -1, sizeof(memo));
	memset(pmemo, -1, sizeof(pmemo));
	int k;
	cin>>k;
	int dg = bs1a(k);
	VI tx;
	int dfd = bs1b(dg, k);
	k -= pfxd(dfd-1, dg);
	tx.pb(dfd);
	for(int i=dg-1;i>0;i--)
	{
		int sx1 = 0, sx2 = 0, sx3 = 0;
		if(dfd > 0)
		sx1 = xd(dfd-1, i);
		sx2 = xd(dfd, i);
		if(dfd < 9)
		sx3 = xd(dfd+1, i);
		if(sx1 >= k)
		dfd--;
		else if((sx1 + sx2) >= k)
		k -= sx1;
		else
		{
			k -= (sx1 + sx2);
			dfd++;
		}
		tx.pb(dfd);
	}
	for(auto u : tx)
	cout<<u;
	cout<<"\n";
	return;	
}

int main(void)
{
	FLASH();
	int T;
	T = 1;

// #ifndef ONLINE_JUDGE
// 	time_t time_t1, time_t2;
// 	time_t1 = clock();
// #endif

	while(T--)
	solve(T);

// #ifndef ONLINE_JUDGE
// 	time_t2 = clock();
// 	SETF();
// 	cout<<"Time taken: "<<setprecision(7)<<(time_t2 - time_t1)/(double)CLOCKS_PER_SEC<<"\n";
// 	UNSETF();
// #endif

	return 0;
}

Measured memory_bytes: 256