#include <bits/stdc++.h>
int main() {
  long long int num, i = 1;
  int k, sum;
  scanf("%d", &k);
  while (k) {
    sum = 0, num = i;
    while (num) {
      sum += num % 10;
      num /= 10;
    }
    if (sum == 10) k--;
    i++;
  }
  printf("%lld\n", i - 1);
  return 0;
}

### Prompt

Your task is to create 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>
int main() {
  long long int num, i = 1;
  int k, sum;
  scanf("%d", &k);
  while (k) {
    sum = 0, num = i;
    while (num) {
      sum += num % 10;
      num /= 10;
    }
    if (sum == 10) k--;
    i++;
  }
  printf("%lld\n", i - 1);
  return 0;
}

```