#include <bits/stdc++.h>
using namespace std;
int k, x, d;
int main() {
  cin >> k;
  for (int i = 19;; i += 9) {
    x = i, d = 0;
    while (x) d += x % 10, x /= 10;
    if (d == 10) k--;
    if (!k) {
      cout << i;
      break;
    }
  }
}

### 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;
int k, x, d;
int main() {
  cin >> k;
  for (int i = 19;; i += 9) {
    x = i, d = 0;
    while (x) d += x % 10, x /= 10;
    if (d == 10) k--;
    if (!k) {
      cout << i;
      break;
    }
  }
}

```