#include <bits/stdc++.h>
using namespace std;
int sum_of_dig(int n) {
  int res = 0;
  while (n > 0) {
    int r = n % 10;
    res += r;
    n = n / 10;
  }
  return res;
}
int main() {
  int k;
  cin >> k;
  int ans = 0;
  while (k > 0) {
    ans++;
    if (sum_of_dig(ans) == 10) {
      k--;
    }
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Please provide a cpp coded solution 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>
using namespace std;
int sum_of_dig(int n) {
  int res = 0;
  while (n > 0) {
    int r = n % 10;
    res += r;
    n = n / 10;
  }
  return res;
}
int main() {
  int k;
  cin >> k;
  int ans = 0;
  while (k > 0) {
    ans++;
    if (sum_of_dig(ans) == 10) {
      k--;
    }
  }
  cout << ans << endl;
  return 0;
}

```