#include <bits/stdc++.h>
using namespace std;
bool can(int x) {
  int res = 0;
  while (x) {
    int tmp = x % 10;
    res += tmp;
    x /= 10;
  }
  return res == 10;
}
int main() {
  int n;
  cin >> n;
  int num = 0, ans = 0;
  for (int i = 19; i <= 2e7 + 5; i++) {
    if (can(i)) num++;
    if (num == n) {
      ans = i;
      break;
    }
  }
  cout << ans << endl;
}

### 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;
bool can(int x) {
  int res = 0;
  while (x) {
    int tmp = x % 10;
    res += tmp;
    x /= 10;
  }
  return res == 10;
}
int main() {
  int n;
  cin >> n;
  int num = 0, ans = 0;
  for (int i = 19; i <= 2e7 + 5; i++) {
    if (can(i)) num++;
    if (num == n) {
      ans = i;
      break;
    }
  }
  cout << ans << endl;
}

```