#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
 
#define FOR(i, x, n) for(ll i = x; i < n; i++) 
#define pb push_back
#define pf push_front
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first 
#define ss second
#define vi vector<int>
#define all(s) s.begin(), s.end()
#define si size()
 
template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; } 
 
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
 
 
const int N = 5e5 + 5;
const int MAXN = 1e5 + 5;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int INF = 1e15;
const int LG = 21;
 
int arr[N];
int posn[N];
int prime[N];
string input;
int DP[11][2][20][2];

int f(int idx, bool less, int prev, bool start)
{
	if(idx == input.size())
	{
		return 1;
	}
	if(~DP[prev][less][idx][start]) return DP[prev][less][idx][start];
	int limit = 9;
	if(!less)
	{
		limit = input[idx] - '0';
	}
	int ret = 0;
	for(int i = 0; i <= 9; i++)
	{
		if(start)
		{
			if(less)
			{
				if(abs(prev - i) <= 1)
				{
					ret += f(idx + 1, (less | (i < limit)), i, start);
				}
			}
			else
			{
				if(abs(prev - i) <= 1 and i <= limit)
				{
					ret += f(idx + 1, (less | (i < limit)), i, start);
				}	
			}
		}
		else
		{
			if(less) 
			{
				ret += f(idx + 1, (less | (i < limit)), i, (i != 0));
			}
			else if(i <= limit)
			{
				ret += f(idx + 1, (less | (i < limit)), i, (i != 0));
			}
		}
	}
	return DP[prev][less][idx][start] = ret;
}
 
void solve() 
{
	int n, k;
	cin >> k;
	int s = 1;
	int e = 1e18;
	// memset(DP, -1, sizeof(DP));
	// input = to_string(3234566667);
	// trace(input);
	// trace(f(0, 0, 0, 0) - 1);
	while(s <= e)
	{
		int mid = s + e >> 1LL;
		input = to_string(mid);
		memset(DP, -1, sizeof(DP));
		int temp = f(0, 0, 0, 0) - 1;
		if(temp >= k)
		{
			e = mid - 1;
		}
		else
		{
			s = mid + 1;
		}
	}
	cout << e + 1 << endl;
}
 
 
int32_t main() 
{	
    ios_base:: sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	    int t = 1;
	    // cin >> t;
	while(t--)solve();
	return 0;
}

Measured memory_bytes: 256