#include <bits/stdc++.h>
using namespace std;
long long M = 1e9 + 7;
bool dig(long long x) {
  long long res = 0;
  while (x) {
    res += x % 10;
    x /= 10;
  }
  return ((res == 10));
}
int main() {
  long long k;
  cin >> k;
  vector<long long> ans;
  for (long long i = 1; i <= 10800100 && ans.size() <= k + 2; ++i) {
    if (dig(i)) ans.push_back(i);
  }
  cout << ans[k - 1] << "\n";
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;
long long M = 1e9 + 7;
bool dig(long long x) {
  long long res = 0;
  while (x) {
    res += x % 10;
    x /= 10;
  }
  return ((res == 10));
}
int main() {
  long long k;
  cin >> k;
  vector<long long> ans;
  for (long long i = 1; i <= 10800100 && ans.size() <= k + 2; ++i) {
    if (dig(i)) ans.push_back(i);
  }
  cout << ans[k - 1] << "\n";
}

```