#include <bits/stdc++.h>
using namespace std;
bool ok(long long k) {
  int c = 0;
  while (k != 0) {
    c += k % 10;
    k = k / 10;
  }
  if (c == 10) return 1;
  return 0;
}
int main() {
  int cnt = 0;
  int n;
  scanf("%d", &n);
  for (long long i = 1; cnt <= n; i++) {
    if (ok(i)) {
      cnt++;
    }
    if (cnt == n) {
      cout << i << endl;
      return 0;
    }
  }
}

### Prompt

Develop a solution in Cpp to the problem described below:

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;
bool ok(long long k) {
  int c = 0;
  while (k != 0) {
    c += k % 10;
    k = k / 10;
  }
  if (c == 10) return 1;
  return 0;
}
int main() {
  int cnt = 0;
  int n;
  scanf("%d", &n);
  for (long long i = 1; cnt <= n; i++) {
    if (ok(i)) {
      cnt++;
    }
    if (cnt == n) {
      cout << i << endl;
      return 0;
    }
  }
}

```