#include <bits/stdc++.h>
using namespace std;
int the_10_sum(int n) {
  int sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  int n;
  cin >> n;
  int k = 0, a[100001] = {0};
  for (int i = 19; i < 0xffffff; i++) {
    if (the_10_sum(i) == 10) {
      a[k] = i;
      ++k;
    }
  }
  cout << a[n - 1];
  return 0;
}

### Prompt

Generate 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;
int the_10_sum(int n) {
  int sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  int n;
  cin >> n;
  int k = 0, a[100001] = {0};
  for (int i = 19; i < 0xffffff; i++) {
    if (the_10_sum(i) == 10) {
      a[k] = i;
      ++k;
    }
  }
  cout << a[n - 1];
  return 0;
}

```