#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< pair<long long, long long> > vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue< pair<int, int> > qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) do{ \
  sort(v.begin(), v.end()); \
  decltype(v)::iterator result = unique(v.begin(), v.end()); \
  v.erase(result, v.end()); \
}while(0)
#define fi(init, n) for(int i = init; i < n; ++i)
#define fj(init, n) for(int j = init; j < n; ++j)
#define fk(init, n) for(int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };

template<typename T>
T gcd(T a, T b) {
	return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
	return a / gcd(a, b) * b;
}
template<typename T>
int finder(vector<T> vec, T number) {
	auto itr = find(vec.begin(), vec.end(), number);
	size_t index = distance(vec.begin(), itr);
	if (index != vec.size()) return 1;
	else return 0;
}
ll frac(ll n){
	if (n == 0) return 1;
	return (n * frac(n - 1)) % MOD;
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

void bfs(ll n, ll m, ll num, vll& v) 
{ 
    // Queue will contain all the stepping Numbers 
    queue<ll> q; 
  
    q.push(num); 
  
    while (!q.empty()) 
    { 
        // Get the front element and pop from the queue 
        ll stepNum = q.front(); 
        q.pop(); 
  
        // If the Stepping Number is in the range 
        // [n, m] then display 
        if (stepNum <= m && stepNum >= n) 
            // cout << stepNum << " "; 
            v.push_back(stepNum);
  
        // If Stepping Number is 0 or greater than m, 
        // need to explore the neighbors 
        if (num == 0 || stepNum > m) 
            continue; 
  
        // Get the last digit of the currently visited 
        // Stepping Number 
        ll lastDigit = stepNum % 10; 
  
        // There can be 2 cases either digit to be 
        // appended is lastDigit + 1 or lastDigit - 1 
        ll stepNumA = stepNum * 10 + (lastDigit- 1); 
        ll stepNumC = stepNum * 10 + (lastDigit); 
        ll stepNumB = stepNum * 10 + (lastDigit + 1); 
  
        // If lastDigit is 0 then only possible digit 
        // after 0 can be 1 for a Stepping Number 
        if (lastDigit == 0) 
            q.push(stepNumB); 
  
        //If lastDigit is 9 then only possible 
        //digit after 9 can be 8 for a Stepping 
        //Number 
        else if (lastDigit == 9) 
            q.push(stepNumA); 
  
        else
        { 
            q.push(stepNumA); 
            q.push(stepNumB); 
        } 
        q.push(stepNumC);
    } 
}

int main(int argc, char** argv) {
#ifdef HIRO
  string quiz(argv[1]);
  string id(argv[2]);
  string filename("input/" + quiz + "/" + id + ".txt");
  ifstream fin(filename);
  if (fin.peek() == ifstream::traits_type::eof()) {
    cout << "No input.";
    return 0;
  }
  ifstream cin(filename);
  std::cin.rdbuf(cin.rdbuf());
#endif
  ll ans = 0;
  ll n;
  cin >> n;
  
  vll v;
  for (int i = 0 ; i <= 9 ; i++) 
    // bfs(1, 3234566667, i, v); 
    bfs(1, 3234566667, i, v); 
    // bfs(1, 3234, i, v); 
    // bfs(1, 300, i, v); 
  // cout << ans << endl;
  sort(all(v));
  // for(ll x: v)
  //   cout << x << " ";
  cout << v[n - 1] << endl;
  return 0;
}



Measured memory_bytes: 1636