#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long k;
  cin >> k;
  long long i = 19;
  long long cnt = 0;
  while (true) {
    long long dp = i;
    long long sum = 0;
    while (dp > 0) {
      long long rem = dp % 10;
      sum += rem;
      dp /= 10;
    }
    if (sum == 10) ++cnt;
    if (cnt == k) {
      cout << i << "\n";
      break;
    } else {
      i += 9;
    }
  }
}

### Prompt

Your task is to create 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;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long k;
  cin >> k;
  long long i = 19;
  long long cnt = 0;
  while (true) {
    long long dp = i;
    long long sum = 0;
    while (dp > 0) {
      long long rem = dp % 10;
      sum += rem;
      dp /= 10;
    }
    if (sum == 10) ++cnt;
    if (cnt == k) {
      cout << i << "\n";
      break;
    } else {
      i += 9;
    }
  }
}

```