#include <bits/stdc++.h>
using namespace std;
int sum(int i) {
  if (i == 0) return 0;
  return i % 10 + sum(i / 10);
}
int main() {
  int i, c = 0, n;
  cin >> n;
  for (i = 19; i <= 10800100; i += 9) {
    if (sum(i) == 10) c++;
    if (c == n) break;
  }
  cout << i;
  return 0;
}

### Prompt

Please create a solution in cpp to 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(int i) {
  if (i == 0) return 0;
  return i % 10 + sum(i / 10);
}
int main() {
  int i, c = 0, n;
  cin >> n;
  for (i = 19; i <= 10800100; i += 9) {
    if (sum(i) == 10) c++;
    if (c == n) break;
  }
  cout << i;
  return 0;
}

```