#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;

int K;
/*
int dp[101010][10];
void solve() {
    itn SUM = 0;
    FOR(20) {
        FOR(d, 10) {
            if (i == 0) {
                if (d)
                    dp[i][d] = 1;
            } else {
                if (d - 1 >= 0) {
                    dp[i][d] += dp[i - 1][d - 1];
                }
                if (d + 1 <= 9) {
                    dp[i][d] += dp[i - 1][d + 1];
                }
                dp[i][d] += dp[i - 1][d];
            }
            dp[i][d] += SUM;
            SUM = dp[i][d];
            cerr << i << " " << d << " " << dp[i][d] << endl;
        }
    }
    string ans;
    bool flag = false;
    int t, n;
    FOR(i, K) {
        FOR(d, 1, 10) {
            if (dp[i][d] >= K) {
                n = i;
                t = d;
                ans.pb('a' + d);
                K -= dp[i][d];
                flag = 1;
                break;
            }
        }
        if (flag)
            break;
    }
    for (int i = n - 1; i >= 0; i--) {
        for (int d = max(0ll, t - 1); d <= min(9ll, t + 1); d++) {
            if (dp[i][d] >= K) {
            }
        }
    }
}
*/
/*
bool check(int num) {
    itn keta = 0;
    int n = num;
    while (n) {
        keta++;
        n /= 10;
    }
    int x = num % 10;
    n = num;
    for (int i = 1; i < keta; i++) {
        n /= 10;
        if (abs((n % 10) - x) > 1) {
            return false;
        }
        x = n % 10;
    }
    return true;
}


void solve() {
    int num = 1;
    int cnt = 0;
    while (cnt < K) {
        if (check(num))
            cnt++;
        num++;
    }
    num--;
    cout << num << endl;
}
*/

int cnt = 1;
void dfs(itn n, int x, string s) {
    s.pb('0' + x);
    if (n == 0) {
        if (cnt == K) {
            cout << s << endl;
            exit(0);
        }
        cnt++;
        return;
    } else {
        for (int nxt = max(0ll, x - 1); nxt <= min(9ll, x + 1); nxt++) {
            dfs(n - 1, nxt, s);
        }
    }
}

void solve() {
    FOR(K) {
        FOR(d, 1, 10) {
            dfs(i, d, "");
        }
    }
}
signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> K;

    solve();
    return 0;
}


Measured memory_bytes: 256