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

### Prompt

Please create a solution in Cpp 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 cal(int num) {
  int ans = 0;
  while (num) {
    ans += num % 10;
    num /= 10;
  }
  return ans;
}
int n;
int main() {
  scanf("%d", &n);
  int ans = 0;
  while (n) {
    ans++;
    if (cal(ans) == 10) n--;
  }
  printf("%d\n", ans);
}

```