#include <bits/stdc++.h>
using namespace std;
int sum(long int k) {
  int ans = 0;
  while (k > 0) {
    ans += (k % 10);
    k /= 10;
  }
  return ans;
}
int main() {
  long int i, k;
  vector<long long int> v;
  for (i = 1; v.size() < 10002; i++) {
    if (10 - sum(i) >= 0) v.push_back(10 * i + 10 - sum(i));
  }
  cin >> k;
  cout << v[k - 1] << "\n";
}

### 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 sum(long int k) {
  int ans = 0;
  while (k > 0) {
    ans += (k % 10);
    k /= 10;
  }
  return ans;
}
int main() {
  long int i, k;
  vector<long long int> v;
  for (i = 1; v.size() < 10002; i++) {
    if (10 - sum(i) >= 0) v.push_back(10 * i + 10 - sum(i));
  }
  cin >> k;
  cout << v[k - 1] << "\n";
}

```