#include <bits/stdc++.h>
int ii(int a) {
  int j = 0;
  for (int i = a; i > 0; i /= 10) {
    j += i % 10;
    if (j > 10) return 0;
  }
  if (j == 10)
    return j;
  else
    return 0;
}
using namespace std;
int main() {
  int k, x = 1;
  cin >> k;
  for (int i = 0;; i++) {
    if (ii(i) != 0) x++;
    if (x == k + 1) {
      cout << i;
      break;
    }
  }
}

### 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>
int ii(int a) {
  int j = 0;
  for (int i = a; i > 0; i /= 10) {
    j += i % 10;
    if (j > 10) return 0;
  }
  if (j == 10)
    return j;
  else
    return 0;
}
using namespace std;
int main() {
  int k, x = 1;
  cin >> k;
  for (int i = 0;; i++) {
    if (ii(i) != 0) x++;
    if (x == k + 1) {
      cout << i;
      break;
    }
  }
}

```