#include <bits/stdc++.h>
int main() {
  long long int t, m, n = 19, l = 0, k = 1;
  scanf("%lli", &t);
  while (k != t) {
    n += 9;
    m = n;
    while (m != 0) {
      l += m % 10;
      m = m / 10;
    }
    if (l == 10) {
      k++;
    }
    l = 0;
  }
  printf("%lli", n);
  return 0;
}

### Prompt

Please create a solution in Cpp 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 t, m, n = 19, l = 0, k = 1;
  scanf("%lli", &t);
  while (k != t) {
    n += 9;
    m = n;
    while (m != 0) {
      l += m % 10;
      m = m / 10;
    }
    if (l == 10) {
      k++;
    }
    l = 0;
  }
  printf("%lli", n);
  return 0;
}

```