#include <bits/stdc++.h>
using namespace std;
const int maxn = 15000000;
inline int f(int x) {
  int ret = 0;
  while (x) {
    ret += (x % 10);
    x = x / 10;
  }
  return ret;
}
int k;
vector<int> ans;
int main() {
  for (int i = 19; i < maxn; i++) {
    if (f(i) == 10) {
      ans.push_back(i);
    }
  }
  scanf("%d", &k);
  printf("%d\n", ans[k - 1]);
  return 0;
}

### 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;
const int maxn = 15000000;
inline int f(int x) {
  int ret = 0;
  while (x) {
    ret += (x % 10);
    x = x / 10;
  }
  return ret;
}
int k;
vector<int> ans;
int main() {
  for (int i = 19; i < maxn; i++) {
    if (f(i) == 10) {
      ans.push_back(i);
    }
  }
  scanf("%d", &k);
  printf("%d\n", ans[k - 1]);
  return 0;
}

```