#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int q;
  long long int n, c, i, t, sum, j = 1;
  cin >> n;
  if (n == 1)
    cout << 19;
  else {
    c = 19;
    for (i = 2; i <= n; i++) {
      c += 9;
      t = c;
      sum = 0;
      while (t > 0) {
        sum += t % 10;
        t /= 10;
      }
      if (sum != 10) {
        while (1) {
          c += 9;
          t = c;
          sum = 0;
          while (t > 0) {
            sum += t % 10;
            t /= 10;
          }
          if (sum == 10) break;
        }
      }
    }
    cout << c;
  }
}

### Prompt

Please provide a CPP coded solution 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 main() {
  long long int q;
  long long int n, c, i, t, sum, j = 1;
  cin >> n;
  if (n == 1)
    cout << 19;
  else {
    c = 19;
    for (i = 2; i <= n; i++) {
      c += 9;
      t = c;
      sum = 0;
      while (t > 0) {
        sum += t % 10;
        t /= 10;
      }
      if (sum != 10) {
        while (1) {
          c += 9;
          t = c;
          sum = 0;
          while (t > 0) {
            sum += t % 10;
            t /= 10;
          }
          if (sum == 10) break;
        }
      }
    }
    cout << c;
  }
}

```