#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  scanf("%d", &k);
  int count = 0;
  for (int i = 1; i < 1000000000; i++) {
    int p = i;
    int ans = 0;
    while (p) {
      ans += p % 10;
      p /= 10;
    }
    if (ans == 10) {
      count++;
    }
    if (count == k) {
      printf("%d\n", i);
      return 0;
    }
  }
}

### 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>
using namespace std;
int main() {
  int k;
  scanf("%d", &k);
  int count = 0;
  for (int i = 1; i < 1000000000; i++) {
    int p = i;
    int ans = 0;
    while (p) {
      ans += p % 10;
      p /= 10;
    }
    if (ans == 10) {
      count++;
    }
    if (count == k) {
      printf("%d\n", i);
      return 0;
    }
  }
}

```