#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i = 1, num, digit, sum, temp;
  scanf("%d", &n);
  num = 19;
  while (i <= n) {
    if (i == n) {
      printf("%d", num);
      break;
    }
    num += 9;
    sum = 0;
    temp = num;
    while (temp > 0) {
      digit = temp % 10;
      temp /= 10;
      sum += digit;
    }
    if (sum == 10) i++;
  }
  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>
using namespace std;
int main() {
  int n, i = 1, num, digit, sum, temp;
  scanf("%d", &n);
  num = 19;
  while (i <= n) {
    if (i == n) {
      printf("%d", num);
      break;
    }
    num += 9;
    sum = 0;
    temp = num;
    while (temp > 0) {
      digit = temp % 10;
      temp /= 10;
      sum += digit;
    }
    if (sum == 10) i++;
  }
  return 0;
}

```