#include <bits/stdc++.h>
using namespace std;
vector<int> answer;
bool is_ans(int i) {
  int sum = 0;
  while (i > 0) {
    sum += i % 10;
    i /= 10;
  }
  return sum == 10;
}
int main() {
  answer.push_back(0);
  for (int i = 0; answer.size() <= 10000; i++) {
    if (is_ans(i)) {
      answer.push_back(i);
    }
  }
  int k;
  cin >> k;
  cout << answer[k] << endl;
}

### Prompt

Generate 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;
vector<int> answer;
bool is_ans(int i) {
  int sum = 0;
  while (i > 0) {
    sum += i % 10;
    i /= 10;
  }
  return sum == 10;
}
int main() {
  answer.push_back(0);
  for (int i = 0; answer.size() <= 10000; i++) {
    if (is_ans(i)) {
      answer.push_back(i);
    }
  }
  int k;
  cin >> k;
  cout << answer[k] << endl;
}

```