#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long i = 19;
  long long sum = 0, c = 0, x;
  while (1) {
    sum = 0;
    for (x = i; x > 0; x = x / 10) {
      sum = sum + x % 10;
    }
    if (sum == 10) {
      c++;
    }
    if (c == n) {
      cout << i;
      break;
    }
    i = i + 9;
  }
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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() {
  long long n;
  cin >> n;
  long long i = 19;
  long long sum = 0, c = 0, x;
  while (1) {
    sum = 0;
    for (x = i; x > 0; x = x / 10) {
      sum = sum + x % 10;
    }
    if (sum == 10) {
      c++;
    }
    if (c == n) {
      cout << i;
      break;
    }
    i = i + 9;
  }
  return 0;
}

```