#include <bits/stdc++.h>
int main() {
  long long int a, j = 0, k = 0, b = 0, c;
  scanf("%lld", &a);
  while (k < a) {
    j++;
    b = 0;
    c = j;
    while (c != 0) {
      b += c % 10;
      c = c / 10;
    }
    if (b == 10) k++;
  }
  printf("%lld\n", j);
}

### Prompt

Construct a CPP code solution to the problem outlined:

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>
int main() {
  long long int a, j = 0, k = 0, b = 0, c;
  scanf("%lld", &a);
  while (k < a) {
    j++;
    b = 0;
    c = j;
    while (c != 0) {
      b += c % 10;
      c = c / 10;
    }
    if (b == 10) k++;
  }
  printf("%lld\n", j);
}

```