#include <bits/stdc++.h>

using namespace std;

const string target = "035";
const int val[] = {0, 3, 5};

long long cnt[30+1][3][15];

long long dfs(int k, int x, int r) {
  if (k == 0) 
    cnt[k][x][r] = (r % 15 == 0) ? 1 : 0;
  if (cnt[k][x][r] != -1) return cnt[k][x][r];
  
  long long ret = 0;
  for (int y = 0; y < 3; y++) {
    if (x > 0 && y == 0) continue;
    ret += dfs(k-1, y, (10 * r + val[y]) % 15);
  }
  return cnt[k][x][r] = ret;
}

string solve(int k, int x, int r, int n) {
  string ret = target.substr(x, 1);

  if (k == 0) {
    assert (n == 0);
    return ret;
  }

  for (int y = 0; y < 3; y++) {
    if (x > 0 && y == 0) continue;
    assert (cnt[k-1][y][(10 * r + val[y]) % 15] >= 0);
    if (n >= cnt[k-1][y][(10 *r + val[y]) % 15])
      n -= cnt[k-1][y][(10 * r + val[y]) % 15];
    else {
      ret += solve(k-1, y, (10 * r + val[y]) % 15, n);
      break;
    }
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  memset(cnt, -1, sizeof(cnt));
  dfs(30, 0, 0);

  int n;
  cin >> n;
  
  string ret = solve(30, 0, 0, n);
  cout << ret.substr(ret.find_last_of("0") + 1) << endl;
  
  return 0;
}