#include <bits/stdc++.h>
using namespace std;
long long vis[100050];
int main() {
  int n;
  long long i, j = 0, k;
  for (i = 0; i < 10900000; i++) {
    k = i;
    int ans = 0;
    while (k) {
      ans += k % 10;
      k /= 10;
    }
    if (ans == 10) {
      vis[j++] = i;
    }
  }
  scanf("%d", &n);
  printf("%d\n", vis[n - 1]);
  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;
long long vis[100050];
int main() {
  int n;
  long long i, j = 0, k;
  for (i = 0; i < 10900000; i++) {
    k = i;
    int ans = 0;
    while (k) {
      ans += k % 10;
      k /= 10;
    }
    if (ans == 10) {
      vis[j++] = i;
    }
  }
  scanf("%d", &n);
  printf("%d\n", vis[n - 1]);
  return 0;
}

```