#include <bits/stdc++.h>
using namespace std;
int main() {
  int k, count = 0, s, num = 10, sum = 0, l;
  cin >> k;
  while (1) {
    sum = 0;
    num = num + 9;
    s = num;
    while (1) {
      l = s % 10;
      sum = sum + l;
      s = s / 10;
      if (s == 0) {
        break;
      }
    }
    if (sum == 10) {
      count++;
      if (count == k) {
        break;
      }
    }
  }
  cout << num << endl;
}

### Prompt

Develop a solution in Cpp 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() {
  int k, count = 0, s, num = 10, sum = 0, l;
  cin >> k;
  while (1) {
    sum = 0;
    num = num + 9;
    s = num;
    while (1) {
      l = s % 10;
      sum = sum + l;
      s = s / 10;
      if (s == 0) {
        break;
      }
    }
    if (sum == 10) {
      count++;
      if (count == k) {
        break;
      }
    }
  }
  cout << num << endl;
}

```