#include <bits/stdc++.h>
using namespace std;
bool sum(int num) {
  int ssum = 0;
  while (num > 0) {
    ssum = ssum + num % 10;
    num = num / 10;
  }
  if (ssum == 10) {
    return true;
  } else {
    return false;
  }
}
int main() {
  int test, num = 19;
  cin >> test;
  while (test > 0) {
    if (sum(num)) {
      test--;
    }
    num += 9;
  }
  cout << num - 9 << endl;
  return 0;
}

### 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 sum(int num) {
  int ssum = 0;
  while (num > 0) {
    ssum = ssum + num % 10;
    num = num / 10;
  }
  if (ssum == 10) {
    return true;
  } else {
    return false;
  }
}
int main() {
  int test, num = 19;
  cin >> test;
  while (test > 0) {
    if (sum(num)) {
      test--;
    }
    num += 9;
  }
  cout << num - 9 << endl;
  return 0;
}

```