#include <bits/stdc++.h>
using namespace std;
int sum(long long int n) {
  int bs = 0;
  while (n) {
    bs = bs + n % 10;
    n = n / 10;
  }
  return bs;
}
int main() {
  long long int n = 0;
  int k;
  cin >> k;
  int i = 0;
  while (i != k) {
    if (sum(n) == 10) {
      i++;
    }
    n++;
  }
  cout << n - 1;
  return 0;
}

### Prompt

Create a solution in cpp for 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 sum(long long int n) {
  int bs = 0;
  while (n) {
    bs = bs + n % 10;
    n = n / 10;
  }
  return bs;
}
int main() {
  long long int n = 0;
  int k;
  cin >> k;
  int i = 0;
  while (i != k) {
    if (sum(n) == 10) {
      i++;
    }
    n++;
  }
  cout << n - 1;
  return 0;
}

```