#include <bits/stdc++.h>
 
using namespace std;
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif


typedef long long ll; 
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
 
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()

const int maxN = 502;

ll dp[maxN][11];
string res;

void go(int len, int ps, ll sum) {
  // debug(len, ps, sum);
  if (len == 0) return;
  if (ps - 1 >= 0 && dp[len][ps - 1] >= sum) {
    res += (char)((ps - 1) + '0');
    go(len - 1, ps - 1, sum);
  } else {
    ll cur = 0;
    if (ps > 0) cur += dp[len][ps - 1];
    if (cur + dp[len][ps] >= sum) {
      res += (char)(ps + '0');
      go(len - 1, ps, sum - cur);
    } else {
      cur += dp[len][ps];
      res += (char)((ps + 1) + '0');
      go(len - 1, ps + 1, sum - cur);
    }
  }
}

void solve() {
  int n;
  cin >> n;
  for (int i = 0 ; i < 10 ; i++) dp[1][i] = (ll)(1);
  for (int i = 2 ; i < 12 ; i++) {
    for (int j = 0 ; j < 10 ; j++) {
      dp[i][j] = dp[i - 1][j] + dp[i - 1][j + 1];
      if (j > 0) dp[i][j] += dp[i - 1][j - 1];
    }
  }
  res = "";
  ll sum = 0;
  for (int i = 1 ; i < 12 ; i++) {
    for (int j = 1 ; j < 10 ; j++) {
      if (sum + dp[i][j] >= n) {
        res += (char)(j + '0');
        go(i - 1, j, n - sum);
        cout << res;
        return;
      } else sum += dp[i][j];
    }
  }
}
 
int main() {
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
 
  return 0;
}

Measured memory_bytes: 256