#include <bits/stdc++.h>
using namespace std;

// clang-format off
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define endl '\n'
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

void solver() {
    int K = input();
    
//    auto nxt_lunlun = [&](string N) {
//        int idx = 0;
//        while (N[idx] == '9') idx++;
//        
//        debug(idx);
//        if (idx == N.size()) {
//            for (auto &i: N) i = '0';
//            N += '1';
//            return N;
//        }
//        
//        if (!idx) idx++;
//        while (idx < N.size() && N[idx] + 1 == N[idx - 1]) idx++;
//        debug(idx);
//
//        N[max(idx - 1, 0)]++;
//        debug(idx);
//        rrange(i, 0, idx) N[i] = max(char(N[i + 1] - 1), '0');
//        
//        return N;
//    };
    
//    string lunlun = "1";
//    range(i, 0, K) {
//        cerr << lunlun << endl;
//        lunlun = nxt_lunlun(lunlun);
//    }
//    
//    cout << lunlun << endl;

    auto is_lunlun = [&](i64 N) {
        vector< int > v;
        while (N) {
            v.push_back(N % 10);
            N /= 10;
        }
        
        range(i, 1, v.size()) {
            if (abs(v[i] - v[i - 1]) > 1) return false;
        }
        
        return true;
    };

    auto next_lunlun = [&](i64 N) {
        i64 D = 1;
        while (true) {
            int a = N / D % 10;
            if (a != 9) {
                i64 d = D;
                i64 n = N / d * d;
                n += d;
                while (d) {
                    d /= 10;
                    n += a * d;
                    a = max(a - 1, 0);
                }

                if (is_lunlun(n)) return n;
            }

            D *= 10;
        }
    };

    i64 lunlun = 1;
    range(i, 1, K) {
        lunlun = next_lunlun(lunlun);
    }
    
    cout << lunlun << endl;
}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 256