#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  vector<int> v;
  for (int i = 1; i < 20000000; ++i) {
    int sum = 0;
    int tmp = i;
    while (tmp) {
      sum += tmp % 10;
      tmp /= 10;
    }
    if (sum == 10) v.push_back(i);
  }
  int k;
  scanf("%d", &k);
  printf("%d\n", v[k - 1]);
  return 0;
}

### Prompt

Your task is to create 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 main(int argc, char const *argv[]) {
  vector<int> v;
  for (int i = 1; i < 20000000; ++i) {
    int sum = 0;
    int tmp = i;
    while (tmp) {
      sum += tmp % 10;
      tmp /= 10;
    }
    if (sum == 10) v.push_back(i);
  }
  int k;
  scanf("%d", &k);
  printf("%d\n", v[k - 1]);
  return 0;
}

```