#include <bits/stdc++.h>
using namespace std;
vector<long long> docs;
inline bool check(long long n) {
  int temp = 0;
  while (n != 0) {
    temp += n % 10;
    n /= 10;
  }
  return temp == 10;
}
inline void call() {
  long long p = 19, s = 0;
  while (true) {
    if (check(p)) {
      docs.push_back(p);
      s++;
    }
    p += 9;
    if (s == 10007) return;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  scanf("%d", &n);
  call();
  printf("%lld\n", docs[n - 1]);
}

### 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;
vector<long long> docs;
inline bool check(long long n) {
  int temp = 0;
  while (n != 0) {
    temp += n % 10;
    n /= 10;
  }
  return temp == 10;
}
inline void call() {
  long long p = 19, s = 0;
  while (true) {
    if (check(p)) {
      docs.push_back(p);
      s++;
    }
    p += 9;
    if (s == 10007) return;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  scanf("%d", &n);
  call();
  printf("%lld\n", docs[n - 1]);
}

```