#include <bits/stdc++.h>
using namespace std;
vector<int> c = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};
long long f(long long N){
  string S = to_string(N);
  int L = S.size();
  vector<vector<long long>> dp1(L + 1, vector<long long>(2, 0));
  vector<vector<long long>> dp2(L + 1, vector<long long>(2, 0));
  dp1[L][0] = 1;
  long long ans = 0;
  for (int i = L - 1; i >= 0; i--){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k <= 9; k++){
        int j2 = j;
        if (k > S[i] - '0'){
          j2 = 1;
        } else if (k < S[i] - '0'){
          j2 = 0;
        }
        dp1[i][j2] += dp1[i + 1][j];
        dp2[i][j2] += dp2[i + 1][j] + c[k] * dp1[i + 1][j];
        if (!(i == 0 && j2 == 1) && k > 0){
          ans += dp2[i + 1][j] + c[k] * dp1[i + 1][j];
        }
      }
    }
  }
  return ans;
}
int main(){
  long long K;
  cin >> K;
  long long tv = 1000000000000000000, fv = 0;
  while (tv - fv > 1){
    long long mid = (tv + fv) / 2;
    if (f(mid) >= K){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  if (f(tv) == K){
    cout << tv << endl;
  } else {
    cout << -1 << endl;
  }
}