#include <bits/stdc++.h>
using namespace std;
int T;
int main() {
  scanf("%d", &T);
  int pos = 0;
  for (int i = 1; i <= T; i++) {
    int temp = 0;
    while (temp != 10) {
      pos++;
      temp = 0;
      int cur = pos;
      while (cur != 0) {
        temp += cur % 10;
        cur /= 10;
      }
    }
  }
  printf("%d\n", pos);
  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 T;
int main() {
  scanf("%d", &T);
  int pos = 0;
  for (int i = 1; i <= T; i++) {
    int temp = 0;
    while (temp != 10) {
      pos++;
      temp = 0;
      int cur = pos;
      while (cur != 0) {
        temp += cur % 10;
        cur /= 10;
      }
    }
  }
  printf("%d\n", pos);
  return 0;
}

```