#include <bits/stdc++.h>
using namespace std;
int n, s = 19, i, sum, j, l;
int main() {
  cin >> n;
  for (i = 1; i < n; i++) {
    s += 9;
    l = s;
    while (l) {
      sum += (l % 10);
      l /= 10;
    }
    if (sum != 10) i--;
    sum = 0;
  }
  cout << s;
}

### 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 n, s = 19, i, sum, j, l;
int main() {
  cin >> n;
  for (i = 1; i < n; i++) {
    s += 9;
    l = s;
    while (l) {
      sum += (l % 10);
      l /= 10;
    }
    if (sum != 10) i--;
    sum = 0;
  }
  cout << s;
}

```