#include <bits/stdc++.h>
using namespace std;
int main() {
  int ans = 0;
  int i, j, pre[10001];
  long long g;
  for (g = 19;; g++) {
    long long s = g;
    int q = 0;
    while (s > 0) {
      q = q + s % 10;
      s /= 10;
      if (q > 10) break;
    }
    if (q == 10) {
      ans += 1;
      pre[ans] = g;
    }
    if (ans == 10000) break;
  }
  scanf("%d", &i);
  printf("%d\n", pre[i]);
  return 0;
}

### Prompt

Please provide a cpp coded solution 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;
int main() {
  int ans = 0;
  int i, j, pre[10001];
  long long g;
  for (g = 19;; g++) {
    long long s = g;
    int q = 0;
    while (s > 0) {
      q = q + s % 10;
      s /= 10;
      if (q > 10) break;
    }
    if (q == 10) {
      ans += 1;
      pre[ans] = g;
    }
    if (ans == 10000) break;
  }
  scanf("%d", &i);
  printf("%d\n", pre[i]);
  return 0;
}

```