#include <bits/stdc++.h>
int sum_of_digit(int i) {
  int k = 0;
  while (i != 0) {
    k = k + i % 10;
    i = i / 10;
  }
  return k;
}
int main() {
  int k, i, l = 0;
  scanf("%d", &k);
  for (i = 10;; i++) {
    if (sum_of_digit(i) == 10) l++;
    if (k == l) break;
  }
  printf("%d", i);
  return 0;
}

### Prompt

In Cpp, your task is to solve 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 sum_of_digit(int i) {
  int k = 0;
  while (i != 0) {
    k = k + i % 10;
    i = i / 10;
  }
  return k;
}
int main() {
  int k, i, l = 0;
  scanf("%d", &k);
  for (i = 10;; i++) {
    if (sum_of_digit(i) == 10) l++;
    if (k == l) break;
  }
  printf("%d", i);
  return 0;
}

```