#include <bits/stdc++.h>
bool sumten(int n) {
  int summ(0);
  while (n > 0) {
    summ += n % 10;
    n = n / 10;
  }
  return summ == 10;
}
int main() {
  using namespace std;
  int a;
  cin >> a;
  int ans = 1;
  int j = 19;
  while (a) {
    if (sumten(j)) {
      ans = j;
      a--;
    }
    j++;
  }
  cout << ans << '\n';
  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>
bool sumten(int n) {
  int summ(0);
  while (n > 0) {
    summ += n % 10;
    n = n / 10;
  }
  return summ == 10;
}
int main() {
  using namespace std;
  int a;
  cin >> a;
  int ans = 1;
  int j = 19;
  while (a) {
    if (sumten(j)) {
      ans = j;
      a--;
    }
    j++;
  }
  cout << ans << '\n';
  return 0;
}

```