#include <bits/stdc++.h>
using namespace std;
bool isPerfect(int n) {
  int sum = 0;
  while (n != 0) {
    sum = sum + (n % 10);
    n = n / 10;
  }
  if (sum == 10) {
    return true;
  }
  return false;
}
int main() {
  int a = 19, b, tmp = 1;
  cin >> b;
  while (tmp != b) {
    a += 9;
    if (isPerfect(a)) {
      tmp++;
      if (tmp == b) {
        break;
      }
    }
  }
  cout << a << endl;
}

### Prompt

In cpp, your task is to solve 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;
bool isPerfect(int n) {
  int sum = 0;
  while (n != 0) {
    sum = sum + (n % 10);
    n = n / 10;
  }
  if (sum == 10) {
    return true;
  }
  return false;
}
int main() {
  int a = 19, b, tmp = 1;
  cin >> b;
  while (tmp != b) {
    a += 9;
    if (isPerfect(a)) {
      tmp++;
      if (tmp == b) {
        break;
      }
    }
  }
  cout << a << endl;
}

```