#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  auto n = 19;
  auto t = 1;
  while (true) {
    auto temp = n;
    auto sum = 0;
    while (temp > 0) {
      auto a = temp % 10;
      temp = temp / 10;
      sum = sum + a;
    }
    if (sum == 10) {
      if (t == k) {
        break;
      } else {
        t++;
      }
    }
    n++;
  }
  cout << n << '\n';
}

### Prompt

Create a solution in CPP for 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;
  auto n = 19;
  auto t = 1;
  while (true) {
    auto temp = n;
    auto sum = 0;
    while (temp > 0) {
      auto a = temp % 10;
      temp = temp / 10;
      sum = sum + a;
    }
    if (sum == 10) {
      if (t == k) {
        break;
      } else {
        t++;
      }
    }
    n++;
  }
  cout << n << '\n';
}

```