#include <bits/stdc++.h>
int main() {
  long long k, cnt = 0;
  std::cin >> k;
  long long i = 1;
  if (k > 5000) {
    cnt = 5000;
    i = 2000009;
  }
  if (k > 7000) {
    cnt = 7000;
    i = 3311021;
  }
  if (k > 8000) {
    cnt = 8000;
    i = 9010001;
  }
  if (k > 9000) {
    cnt = 9000;
    i = 10116101;
  }
  for (; i <= LONG_LONG_MAX; i++) {
    long long tot = 0, tmp = i;
    while (tmp) {
      tot += tmp % 10;
      tmp /= 10;
    }
    if (tot == 10) cnt++;
    if (cnt == k) {
      std::cout << i;
      break;
    }
  }
}

### Prompt

Develop a solution in Cpp to the problem described below:

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>
int main() {
  long long k, cnt = 0;
  std::cin >> k;
  long long i = 1;
  if (k > 5000) {
    cnt = 5000;
    i = 2000009;
  }
  if (k > 7000) {
    cnt = 7000;
    i = 3311021;
  }
  if (k > 8000) {
    cnt = 8000;
    i = 9010001;
  }
  if (k > 9000) {
    cnt = 9000;
    i = 10116101;
  }
  for (; i <= LONG_LONG_MAX; i++) {
    long long tot = 0, tmp = i;
    while (tmp) {
      tot += tmp % 10;
      tmp /= 10;
    }
    if (tot == 10) cnt++;
    if (cnt == k) {
      std::cout << i;
      break;
    }
  }
}

```