#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, M = 5e5 + 5, OO = 0x3f3f3f3f;
bool valid(int x) {
  int s = 0;
  while (x > 0) {
    s += (x % 10);
    x /= 10;
  }
  return (s == 10);
}
int main() {
  int k, ans = 0;
  cin >> k;
  while (k) {
    ans++;
    if (valid(ans)) k--;
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Your challenge is to write 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;
const int N = 1e6 + 5, M = 5e5 + 5, OO = 0x3f3f3f3f;
bool valid(int x) {
  int s = 0;
  while (x > 0) {
    s += (x % 10);
    x /= 10;
  }
  return (s == 10);
}
int main() {
  int k, ans = 0;
  cin >> k;
  while (k) {
    ans++;
    if (valid(ans)) k--;
  }
  cout << ans << endl;
  return 0;
}

```