#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  int i, j, s = 0, count = 0;
  for (int i = 1; i <= 100000000; i++) {
    s = 0;
    j = i;
    while (j != 0) {
      s = s + j % 10;
      j = j / 10;
    }
    if (s == 10) count++;
    if (count == k) {
      cout << i;
      return 0;
    }
  }
  return 0;
}

### 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;
int main() {
  int k;
  cin >> k;
  int i, j, s = 0, count = 0;
  for (int i = 1; i <= 100000000; i++) {
    s = 0;
    j = i;
    while (j != 0) {
      s = s + j % 10;
      j = j / 10;
    }
    if (s == 10) count++;
    if (count == k) {
      cout << i;
      return 0;
    }
  }
  return 0;
}

```