#include <bits/stdc++.h>
using namespace std;
int f(int n) {
  int sum = 0;
  while (n) sum += n % 10, n /= 10;
  return sum;
}
void solve() {
  int k;
  scanf("%d", &k);
  int num = 0;
  while (k--) {
    ++num;
    while (f(num) != 10) ++num;
  }
  printf("%d\n", num);
}
int main() {
  int _ = 1;
  for (int i = 1; i <= _; ++i) solve();
}

### Prompt

Please formulate a Cpp solution 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 f(int n) {
  int sum = 0;
  while (n) sum += n % 10, n /= 10;
  return sum;
}
void solve() {
  int k;
  scanf("%d", &k);
  int num = 0;
  while (k--) {
    ++num;
    while (f(num) != 10) ++num;
  }
  printf("%d\n", num);
}
int main() {
  int _ = 1;
  for (int i = 1; i <= _; ++i) solve();
}

```