#include <bits/stdc++.h>
using namespace std;
int hitung(int x) {
  int o = 0;
  while (x > 0) {
    o += x % 10;
    x /= 10;
  }
  return o;
}
int main() {
  int n;
  scanf("%d", &n);
  int angka = 18;
  while (n > 0) {
    if (hitung(angka) == 10) {
      n--;
    }
    angka++;
  }
  printf("%d\n", angka - 1);
}

### Prompt

Your task is to create 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 hitung(int x) {
  int o = 0;
  while (x > 0) {
    o += x % 10;
    x /= 10;
  }
  return o;
}
int main() {
  int n;
  scanf("%d", &n);
  int angka = 18;
  while (n > 0) {
    if (hitung(angka) == 10) {
      n--;
    }
    angka++;
  }
  printf("%d\n", angka - 1);
}

```