#include <bits/stdc++.h>
int main() {
  int n, c = 19, s = 19, m = 0, i = 1;
  scanf("%d", &n);
  while (i < n) {
    c++;
    s = c;
    while (s) {
      m += s % 10;
      s /= 10;
    }
    if (m == 10) i++;
    m = 0;
  }
  printf("%d", c);
  return 0;
}

### Prompt

Please create a solution in cpp 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 main() {
  int n, c = 19, s = 19, m = 0, i = 1;
  scanf("%d", &n);
  while (i < n) {
    c++;
    s = c;
    while (s) {
      m += s % 10;
      s /= 10;
    }
    if (m == 10) i++;
    m = 0;
  }
  printf("%d", c);
  return 0;
}

```