#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
bool dig(long long x) {
  long long res = 0;
  while (x) {
    res += x % 10;
    x /= 10;
  }
  return ((res == 10));
}
int main() {
  long long k;
  cin >> k;
  vector<long long> ans;
  for (long long i = 1; i <= 10800100 && ans.size() <= k + 2; ++i) {
    if (dig(i)) ans.push_back(i);
  }
  cout << ans[k - 1] << "\n";
}
