#include <bits/stdc++.h>
using namespace std;
bool digitSum(int n) {
  int sum = 0;
  while (n > 0) {
    sum += (n % 10);
    n /= 10;
    if (sum > 10) return false;
  }
  return (sum == 10);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int k, i = 19, count = 0;
  cin >> k;
  while (count < k) {
    if (digitSum(i)) count++;
    i += 9;
  }
  cout << i - 9;
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;
bool digitSum(int n) {
  int sum = 0;
  while (n > 0) {
    sum += (n % 10);
    n /= 10;
    if (sum > 10) return false;
  }
  return (sum == 10);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int k, i = 19, count = 0;
  cin >> k;
  while (count < k) {
    if (digitSum(i)) count++;
    i += 9;
  }
  cout << i - 9;
  return 0;
}

```