#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10, M = 1e6 + 5, OO = 0x3f3f3f3f;
int c, o, sum, p, t, k;
int a[N];
bool f;
int main() {
  cin >> k;
  for (int i = 19; i <= 20000000; i = i + 9) {
    t = i;
    while (t) {
      sum += t % 10;
      t /= 10;
    }
    if (sum == 10) p++;
    if (p == k) {
      cout << i << endl;
      break;
    }
    sum = 0;
  }
  return 0;
}

### Prompt

Create a solution in cpp for 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 long long N = 2e5 + 10, M = 1e6 + 5, OO = 0x3f3f3f3f;
int c, o, sum, p, t, k;
int a[N];
bool f;
int main() {
  cin >> k;
  for (int i = 19; i <= 20000000; i = i + 9) {
    t = i;
    while (t) {
      sum += t % 10;
      t /= 10;
    }
    if (sum == 10) p++;
    if (p == k) {
      cout << i << endl;
      break;
    }
    sum = 0;
  }
  return 0;
}

```