#include <bits/stdc++.h>
using namespace std;
int judge(int x) {
  int sum = 0, temp = x;
  while (temp > 0 && sum <= 10) sum += temp % 10, temp /= 10;
  return sum;
}
int main() {
  int n, ans;
  scanf("%d", &n);
  for (int i = 0; n; i++) {
    if (judge(i) == 10) ans = i, n--;
  }
  printf("%d", ans);
  return 0;
}

### Prompt

Create a solution in Cpp for 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 judge(int x) {
  int sum = 0, temp = x;
  while (temp > 0 && sum <= 10) sum += temp % 10, temp /= 10;
  return sum;
}
int main() {
  int n, ans;
  scanf("%d", &n);
  for (int i = 0; n; i++) {
    if (judge(i) == 10) ans = i, n--;
  }
  printf("%d", ans);
  return 0;
}

```