#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;


constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
    template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }
    template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }
    template<typename T> void chadd(T& a, T b) { a = a + b; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    void CCout(long long x, const char* end = "\n") { std::cerr << x << end; }
    template <typename T> void CCout(const T& x, const char* end = "\n") { std::cerr << x << end; }
    template <typename T> void CCout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cerr << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t sz;
        inp(std::size_t _sz = 1) : sz(_sz) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }
        template <typename T, typename U> operator std::pair<T, U>() const { T f; U s; std::cin >> f >> s; return std::pair<T, U>(f, s); }
    };

    inp inp1; // input one
}

int main() {

    ll k = inp1;

    // 小さいほうからk番目

    // 桁DP?

    ll sum = 0;
    ll digit = 0;

    // 桁を20桁くらいまでやる
    for (ll d = 1; d <= 1000; ++d) {
        // dp[i][j] := i桁目をjにしたときの総数
        vector<vector<ll>> dp(d, vector<ll>(10, 0));
        rep(i, 9) dp[0][i + 1] = 1;

        Rep(i, 1, d) {
            rep(j, 10) {
                for(int k = -1; k <= 1; ++k) {
                    if (j + k >= 0 && j + k <= 9) {
                        dp[i][j] += dp[i - 1][j + k];
                    }
                }
            }
        }

        ll tmp = sum;
        rep(i, 10) {
            tmp += dp[d - 1][i];
        }
        if (tmp >= k) {
            // d桁の値に答えがある
            digit = d;
            break;
        }
        sum = tmp;
    }

    ll num = k - sum;
    // digit桁のなかで条件を満たすnum番目の値

    vector<int> ans(digit, 0);

    sum = 0;
    for (ll d = 0; d < digit; ++d) {
        // d桁目を固定する
        int s = 0;
        if (d == 0) s = 1;
        bool ok = false;

        Rep(i, s, 10) {
            // d桁目をiで固定する
            int left = digit - d;
            vector<vector<ll>> dp(left, vector<ll>(10, 0));
            if (d != 0) {
                int val = ans[d - 1];
                if (abs(val - i) >= 2) {
                    continue;
                }
            }
            dp[0][i] = 1;
            Rep(j, 1, left) {
                rep(k, 10) {
                    for (int m = -1; m <= 1; ++m) {
                        if (m + k >= 0 && k + m <= 9) {
                            dp[j][k] += dp[j - 1][k + m];
                        }
                    }
                }
            }

            ll tmp = sum;
            rep(j, 10) {
                tmp += dp[left - 1][j];
            }
            if (tmp >= num) {
                ans[d] = i;
                num -= sum;
                sum = 0;
                ok = true;
                break;
            }
            sum = tmp;
        }
        if (!ok) {
            if (d == 0) ans[d] = 9;
            else ans[d] = min(9, ans[d - 1] + 1);
        }
    }

    rep(i, digit) {
        cout << ans[i];
    }
    cout << endl;

    return 0;
}


Measured memory_bytes: 256