#include <bits/stdc++.h>
using namespace std;
long long int fun(long long int n) {
  long long int y = 0;
  while (n) {
    y = y + n % 10;
    n = n / 10;
  }
  if (y % 10 == 0)
    return (1);
  else
    return 0;
}
int main() {
  long long int n;
  cin >> n;
  long long int p = 0;
  for (long long int i = 19;; i = i + 9) {
    if (fun(i)) p++;
    if (p == n) {
      cout << i;
      return 0;
    }
  }
  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>
using namespace std;
long long int fun(long long int n) {
  long long int y = 0;
  while (n) {
    y = y + n % 10;
    n = n / 10;
  }
  if (y % 10 == 0)
    return (1);
  else
    return 0;
}
int main() {
  long long int n;
  cin >> n;
  long long int p = 0;
  for (long long int i = 19;; i = i + 9) {
    if (fun(i)) p++;
    if (p == n) {
      cout << i;
      return 0;
    }
  }
  return 0;
}

```