#include <bits/stdc++.h>
using namespace std;
const int E = 1e5 + 5, M = 1e9 + 5;
bool asccmp(pair<int, int> x, pair<int, int> y) { return x.second < y.second; }
long long a, b, c, j;
int sum(int q) {
  int h = 0;
  while (q > 0) {
    h += q % 10;
    q /= 10;
  }
  return h;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> a;
  for (int q = 19; q <= 100000000; q++) {
    if (sum(q) == 10) {
      j++;
      if (j == a) {
        cout << q;
        return 0;
      }
    }
  }
}

### Prompt

Generate a Cpp solution 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;
const int E = 1e5 + 5, M = 1e9 + 5;
bool asccmp(pair<int, int> x, pair<int, int> y) { return x.second < y.second; }
long long a, b, c, j;
int sum(int q) {
  int h = 0;
  while (q > 0) {
    h += q % 10;
    q /= 10;
  }
  return h;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> a;
  for (int q = 19; q <= 100000000; q++) {
    if (sum(q) == 10) {
      j++;
      if (j == a) {
        cout << q;
        return 0;
      }
    }
  }
}

```