#include <bits/stdc++.h>
using namespace std;
bool chk(int x) {
  int sm = 0;
  while (x > 0) {
    sm += x % 10;
    x /= 10;
    if (sm > 10) break;
  }
  if (sm == 10)
    return 1;
  else
    return 0;
}
int main() {
  int n, m, i, j = 1, p, q, l, r, a, cnt, ans[10002];
  for (i = 19;; i++) {
    p = i;
    if (chk(p)) ans[j++] = i;
    if (j == 10001) break;
  }
  while (cin >> n) {
    cout << ans[n] << endl;
  }
}

### 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;
bool chk(int x) {
  int sm = 0;
  while (x > 0) {
    sm += x % 10;
    x /= 10;
    if (sm > 10) break;
  }
  if (sm == 10)
    return 1;
  else
    return 0;
}
int main() {
  int n, m, i, j = 1, p, q, l, r, a, cnt, ans[10002];
  for (i = 19;; i++) {
    p = i;
    if (chk(p)) ans[j++] = i;
    if (j == 10001) break;
  }
  while (cin >> n) {
    cout << ans[n] << endl;
  }
}

```