#include <bits/stdc++.h>
using namespace std;
long t;
bool kt(long x) {
  t = 0;
  while (x > 0) {
    t += x % 10;
    x /= 10;
  }
  if (t <= 10) return true;
  return false;
}
int main() {
  vector<long> h;
  long k, s = 0, tong, kq;
  cin >> k;
  for (long i = 1;; ++i) {
    if (kt(i)) h.push_back(i);
    if (h.size() == k) {
      cout << h[k - 1] * 10 + (10 - t);
      return 0;
    }
  }
}

### Prompt

Your task is to create a Cpp solution to the following problem:

We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.

Input

A single line with a positive integer k (1 ≤ k ≤ 10 000).

Output

A single number, denoting the k-th smallest perfect integer.

Examples

Input

1


Output

19


Input

2


Output

28

Note

The first perfect integer is 19 and the second one is 28.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long t;
bool kt(long x) {
  t = 0;
  while (x > 0) {
    t += x % 10;
    x /= 10;
  }
  if (t <= 10) return true;
  return false;
}
int main() {
  vector<long> h;
  long k, s = 0, tong, kq;
  cin >> k;
  for (long i = 1;; ++i) {
    if (kt(i)) h.push_back(i);
    if (h.size() == k) {
      cout << h[k - 1] * 10 + (10 - t);
      return 0;
    }
  }
}

```