#include <bits/stdc++.h>
using namespace std;
bool ten(long long int n) {
  long long int sum = 0;
  while (n) {
    sum += (n % 10);
    n /= 10;
  }
  if (sum == 10) return true;
  return false;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int k, cnt = 0, n = 10;
  cin >> k;
  while (1) {
    if (ten(n += 9)) ++cnt;
    if (cnt == k) break;
  }
  cout << n << "\n";
  return 0;
}

### Prompt

Develop a solution in cpp 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;
bool ten(long long int n) {
  long long int sum = 0;
  while (n) {
    sum += (n % 10);
    n /= 10;
  }
  if (sum == 10) return true;
  return false;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int k, cnt = 0, n = 10;
  cin >> k;
  while (1) {
    if (ten(n += 9)) ++cnt;
    if (cnt == k) break;
  }
  cout << n << "\n";
  return 0;
}

```