#include <bits/stdc++.h>
using namespace std;
int findnth(int n) {
  int count = 0;
  for (int curr = 19;; curr += 9) {
    int sum = 0;
    for (int x = curr; x > 0; x = x / 10) sum = sum + x % 10;
    if (sum == 10) count++;
    if (count == n) return curr;
  }
  return -1;
}
int main() {
  int n;
  scanf("%d", &n);
  printf("%d\n", findnth(n));
  return 0;
}

### 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;
int findnth(int n) {
  int count = 0;
  for (int curr = 19;; curr += 9) {
    int sum = 0;
    for (int x = curr; x > 0; x = x / 10) sum = sum + x % 10;
    if (sum == 10) count++;
    if (count == n) return curr;
  }
  return -1;
}
int main() {
  int n;
  scanf("%d", &n);
  printf("%d\n", findnth(n));
  return 0;
}

```