#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

const int num[]{1, 0, 0, 0, 1, 0, 1, 0, 2, 1};

ll f(const ll n) {
  ll dp1[2][2]{}, dp2[2][2]{};
  dp1[false][true] = 1;
  for (char c : to_string(n)) {
    const int v = c - '0';
    ll ndp1[2][2]{}, ndp2[2][2]{};
    REP(i, 2) REP(j, 2) {
      ndp1[i || (v > 0)][j] += dp1[i][j];
      ndp2[i || (v > 0)][j] += dp2[i][j] + (j ? 0 : dp1[i][j]);
      FOR(k, 1, 10) {
        int ni = -1;
        if (k > v) {
          if (i) ni = true;
        } else if (k == v) {
          ni = i;
        } else {
          ni = true;
        }
        if (ni != -1) {
          ndp1[ni][false] += dp1[i][j];
          ndp2[ni][false] += dp2[i][j] + dp1[i][j] * num[k];
        }
      }
    }
    swap(dp1, ndp1);
    swap(dp2, ndp2);
  }
  ll ans = 0;
  REP(i, 2) REP(j, 2) ans += dp2[i][j];
  return ans;
}

int main() {
  ll k; cin >> k;
  ll lb = 0, ub = 99193752409910741;
  while (ub - lb > 1) {
    const ll n = (lb + ub) / 2;
    (f(n) < k ? lb : ub) = n;
  }
  cout << (f(ub) == k ? ub : -1) << '\n';
  return 0;
}