#include <bits/stdc++.h>
using namespace std;
int cnt = 0;
int n;
int sum(int x) {
  int res = 0;
  while (x > 0) {
    res += (x % 10);
    x /= 10;
  }
  return res;
}
int main() {
  int i = 19;
  cin >> n;
  while (1) {
    if (sum(i) == 10) cnt++;
    if (cnt == n) {
      cout << i;
      return 0;
    }
    i += 9;
  }
}

### 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 cnt = 0;
int n;
int sum(int x) {
  int res = 0;
  while (x > 0) {
    res += (x % 10);
    x /= 10;
  }
  return res;
}
int main() {
  int i = 19;
  cin >> n;
  while (1) {
    if (sum(i) == 10) cnt++;
    if (cnt == n) {
      cout << i;
      return 0;
    }
    i += 9;
  }
}

```