#include <bits/stdc++.h>
using namespace std;
bool is_perfect(long long n) {
  long long sum = 0;
  while (n > 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum == 10;
}
int main(void) {
  long long k;
  cin >> k;
  long long n = 0;
  while (k > 0) {
    n++;
    if (is_perfect(n)) {
      k--;
    }
  }
  cout << n << endl;
  return 0;
}

### Prompt

Your challenge is to write 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;
bool is_perfect(long long n) {
  long long sum = 0;
  while (n > 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum == 10;
}
int main(void) {
  long long k;
  cin >> k;
  long long n = 0;
  while (k > 0) {
    n++;
    if (is_perfect(n)) {
      k--;
    }
  }
  cout << n << endl;
  return 0;
}

```