#include <bits/stdc++.h>
int a[10001], t;
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 1;; i++) {
    int sum = 0, x = i;
    while (x) sum += x % 10, x /= 10;
    if (sum == 10) k--;
    if (k == 0) {
      printf("%d", i);
      return 0;
    }
  }
  return 0;
}

### Prompt

Please formulate 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>
int a[10001], t;
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 1;; i++) {
    int sum = 0, x = i;
    while (x) sum += x % 10, x /= 10;
    if (sum == 10) k--;
    if (k == 0) {
      printf("%d", i);
      return 0;
    }
  }
  return 0;
}

```