#include <bits/stdc++.h>
using namespace std;
int k;
bool check(int x) {
  int sum = 0;
  while (x > 0) {
    sum += x % 10;
    x /= 10;
  }
  return sum == 10;
}
int main() {
  cin >> k;
  for (int i = 19; i <= 0x3f3f3f3f; i++) {
    if (check(i)) k--;
    if (k == 0) {
      cout << i;
      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 check(int x) {
  int sum = 0;
  while (x > 0) {
    sum += x % 10;
    x /= 10;
  }
  return sum == 10;
}
int main() {
  cin >> k;
  for (int i = 19; i <= 0x3f3f3f3f; i++) {
    if (check(i)) k--;
    if (k == 0) {
      cout << i;
      return 0;
    }
  }
}

```