#include <bits/stdc++.h>
using namespace std;
int kano() {
  char ch = getchar();
  int w = 0, u = 1;
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') u = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) w = w * 10 + ch - '0';
  return w * u;
}
int k, t;
int main() {
  k = kano();
  for (int i = 1; t < k; i++) {
    int aa = 0;
    for (int j = i; j != 0; j = j / 10) {
      aa += j % 10;
    }
    if (aa == 10) t++;
    if (t == k) {
      printf("%d", i);
      return 0;
    }
  }
}

### Prompt

Your challenge is to write 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 kano() {
  char ch = getchar();
  int w = 0, u = 1;
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') u = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) w = w * 10 + ch - '0';
  return w * u;
}
int k, t;
int main() {
  k = kano();
  for (int i = 1; t < k; i++) {
    int aa = 0;
    for (int j = i; j != 0; j = j / 10) {
      aa += j % 10;
    }
    if (aa == 10) t++;
    if (t == k) {
      printf("%d", i);
      return 0;
    }
  }
}

```