#include <bits/stdc++.h>
using namespace std;
long long in() {
  long long a;
  scanf("%lld", &a);
  return a;
}
int main() {
  int k = in();
  long long x = 19;
  while (--k) {
    x += 9;
    long long bal = x;
    bool hoise = 1;
    while (hoise) {
      int sum = 0;
      bal = x;
      while (bal) {
        sum += (bal % 10);
        bal /= 10;
      }
      if (sum == 10)
        break;
      else
        x += 9;
    }
  }
  printf("%lld\n", x);
}

### Prompt

Please formulate 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;
long long in() {
  long long a;
  scanf("%lld", &a);
  return a;
}
int main() {
  int k = in();
  long long x = 19;
  while (--k) {
    x += 9;
    long long bal = x;
    bool hoise = 1;
    while (hoise) {
      int sum = 0;
      bal = x;
      while (bal) {
        sum += (bal % 10);
        bal /= 10;
      }
      if (sum == 10)
        break;
      else
        x += 9;
    }
  }
  printf("%lld\n", x);
}

```