#include <bits/stdc++.h>
using namespace std;
bool isperfect(int x) {
  int s = 0;
  while (x != 0) {
    s += x % 10;
    x /= 10;
  }
  return (s == 10);
}
int main() {
  long int k, c = 0;
  cin >> k;
  for (long int i = 19; i < 1e9; i++) {
    if (isperfect(i)) {
      c++;
    }
    if (c == k) {
      cout << i << endl;
      break;
    }
  }
}

### 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;
bool isperfect(int x) {
  int s = 0;
  while (x != 0) {
    s += x % 10;
    x /= 10;
  }
  return (s == 10);
}
int main() {
  long int k, c = 0;
  cin >> k;
  for (long int i = 19; i < 1e9; i++) {
    if (isperfect(i)) {
      c++;
    }
    if (c == k) {
      cout << i << endl;
      break;
    }
  }
}

```