#include <bits/stdc++.h>
using namespace std;
int k;
bool e_perfect(int n) {
  short sum = 0;
  do {
    sum += n % 10;
    if (sum > 10) return false;
    n /= 10;
  } while (n);
  return 10 == sum;
}
int main() {
  cin >> k;
  short count = 0;
  for (int i = 19; 1; ++i)
    if (e_perfect(i)) {
      ++count;
      if (k == count) {
        cout << i;
        return 0;
      }
    }
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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;
int k;
bool e_perfect(int n) {
  short sum = 0;
  do {
    sum += n % 10;
    if (sum > 10) return false;
    n /= 10;
  } while (n);
  return 10 == sum;
}
int main() {
  cin >> k;
  short count = 0;
  for (int i = 19; 1; ++i)
    if (e_perfect(i)) {
      ++count;
      if (k == count) {
        cout << i;
        return 0;
      }
    }
  return 0;
}

```