#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, z, k, w;
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (20000000); i++) {
    x = i, y = 0;
    while (x > 0) y += x % 10, x /= 10;
    if (y == 10) k++;
    if (k == n) {
      printf("%d\n", i);
      return 0;
    }
  }
  return 0;
}

### Prompt

Your challenge is to write 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;
int n, m, x, y, z, k, w;
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (20000000); i++) {
    x = i, y = 0;
    while (x > 0) y += x % 10, x /= 10;
    if (y == 10) k++;
    if (k == n) {
      printf("%d\n", i);
      return 0;
    }
  }
  return 0;
}

```