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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[21][10];
ll sum[21];

int main(int argc, char const* argv[])
{
  int k; cin >> k;
  rep(i, 10){
    dp[1][i] = 1;
  }
  dp[1][0] = 1;
  sum[1] = 9;
  FOR(i, 2, 20){
    rep(j, 10){
      if(j+1<10)(dp[i][j] += dp[i-1][j+1]);
      dp[i][j] += dp[i-1][j];
      if(j-1>=0)(dp[i][j] += dp[i-1][j-1]);
    }
    FOR(j, 1, 10){
      sum[i] += dp[i][j];
    }
    sum[i] += sum[i-1];
  }
  vector<int> res;
  int pre = -1;
  int st = 0;
  for(st = 1; st <= 19; st++){
    if(sum[st-1] < k && sum[st] >= k){
      break;
    }
  }
  ll curr = sum[st-1];
  for(int i = st; i >= 1; i--){
    if(pre == -1){
      FOR(j, 1, 10){
        if(curr + dp[i][j] >= k){
          res.pb(j);
          pre = j;
          break;
        }
        curr += dp[i][j];
      }
    }else{
      for(int j = pre - 1; j <= pre + 1; j++){
        if(j < 0)continue;
        if(curr + dp[i][j] >= k){
          pre = j;
          res.pb(j);
          break;
        }
        curr += dp[i][j];
      }
    }
  }
  reverse(whole(res));
  while(sz(res) > 1 && res.back() == 0)res.pop_back();
  reverse(whole(res));
  rep(i, sz(res))cout << res[i];
  cout << endl;
  return 0;
}


Measured memory_bytes: 256