#include <bits/stdc++.h>
using namespace std;
int main() {
  int i;
  cin >> i;
  int j, k, l = 0, m = 0, n = 0, h, a;
  for (j = 19;; j++) {
    a = j;
    h = j;
    for (k = 1; k <= 10; k++) {
      l = h % 10;
      h = h / 10;
      m = l + m;
      if (h < 10) {
        m = m + h;
        break;
      }
    }
    if (m == 10) {
      n = n + 1;
      if (n == i) {
        cout << a << endl;
        break;
      }
    }
    m = 0;
  }
  return 0;
}

### Prompt

Generate 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 i;
  cin >> i;
  int j, k, l = 0, m = 0, n = 0, h, a;
  for (j = 19;; j++) {
    a = j;
    h = j;
    for (k = 1; k <= 10; k++) {
      l = h % 10;
      h = h / 10;
      m = l + m;
      if (h < 10) {
        m = m + h;
        break;
      }
    }
    if (m == 10) {
      n = n + 1;
      if (n == i) {
        cout << a << endl;
        break;
      }
    }
    m = 0;
  }
  return 0;
}

```