//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 1e-5;
const ld EPS2 = 1e-6;
const ld PI = acos(-1);
const ll MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const ll inf = 4e9;
const ll INF = 1000 * 1000 * 1000ll * 1000 * 1000 * 1000;
const ll kekmod = 1791791791;
const ll bestmod = 1148822869;
#define int ll
ll calcdp(int dig, int len)
{
	vector<vector<int>> dp(10, vector<int>(len + 1));
	dp[dig][1] = 1;
	for (int i = 1; i < len; ++i)
	{
		for (int d = 0; d < 10; ++d)
		{
			for (int kek = 0; kek < 10; ++kek)
			{
				if (abs(d - kek) < 2)
				{
					dp[kek][i + 1] += dp[d][i];
				}
			}
		}
	}
	ll sum = 0;
	for (int i = 0; i < 10; ++i) sum += dp[i][len];
	return sum;
}
ll calcdp(int len)
{
	ll ans = 0;
	for (int i = 1; i < 10; ++i)
	{
		ans += calcdp(i, len);
	}
	return ans;
}
int ans = 0;
int tlen;
void refrain(int len, int am,int digg)
{	
	if (!len)return;
	int was = 0;
	for (int dg = (len == tlen ? 1 : max(0ll, digg-1)); dg <= (len == tlen ? 9 : min(9ll, digg + 1)); ++dg)
	{
		if (calcdp(dg, len) >= am)
		{
			ans = ans * 10 + dg;
			refrain(len - 1, am,  dg);
			return;
		}
		else
		{
			am -= calcdp(dg, len);
		}
	}
}
signed main()
{
	fastio();
	int k;
	cin >> k;
	int was = 0;

	int len;
	for (len = 1;; ++len)
	{
		if (calcdp(len) >= k)
		{
			break;
		}
		k -= calcdp(len);
	}
	tlen = len;
	refrain(len, k, 0);
	cout << ans;
	sp;
}

Measured memory_bytes: 504