#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
bool sum(int n) {
  int s = 0;
  while (n != 0) {
    s += (n % 10);
    n /= 10;
  }
  if (s == 10)
    return true;
  else
    return false;
}
void solve() {
  int k;
  cin >> k;
  int n = 19;
  while (k) {
    if (sum(n)) k--;
    n++;
  }
  cout << n - 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    solve();
  }
}

### Prompt

Please provide a Cpp coded solution 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;
using namespace std::chrono;
bool sum(int n) {
  int s = 0;
  while (n != 0) {
    s += (n % 10);
    n /= 10;
  }
  if (s == 10)
    return true;
  else
    return false;
}
void solve() {
  int k;
  cin >> k;
  int n = 19;
  while (k) {
    if (sum(n)) k--;
    n++;
  }
  cout << n - 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    solve();
  }
}

```