#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  int z = 1;
  for (int i = 1; i <= k; i++, z++) {
    int t = 11;
    while (t > 10) {
      t = 0;
      int tmp = z;
      while (tmp != 0) {
        t += tmp % 10;
        tmp /= 10;
      }
      if (t > 10) z++;
    }
  }
  z--;
  int tmp = z, t = 0;
  while (tmp != 0) {
    t += tmp % 10;
    tmp /= 10;
  }
  z *= 10;
  z += (10 - t);
  cout << z << endl;
  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 z = 1;
  for (int i = 1; i <= k; i++, z++) {
    int t = 11;
    while (t > 10) {
      t = 0;
      int tmp = z;
      while (tmp != 0) {
        t += tmp % 10;
        tmp /= 10;
      }
      if (t > 10) z++;
    }
  }
  z--;
  int tmp = z, t = 0;
  while (tmp != 0) {
    t += tmp % 10;
    tmp /= 10;
  }
  z *= 10;
  z += (10 - t);
  cout << z << endl;
  return 0;
}

```