#include <bits/stdc++.h>
using namespace std;
int k;
long long ans[10009];
bool chk(long long n) {
  int m = 0;
  while (n) {
    m += (n % 10);
    n /= 10;
    if (m > 10) return 0;
  }
  return (m == 10);
}
int main() {
  cin >> k;
  ans[0] = 19;
  for (int i = 1; i <= 10000; i++) {
    ans[i] = ans[i - 1] + 9;
    while (!chk(ans[i])) ans[i] += 9;
  }
  cout << ans[k - 1];
  return 0;
}

### Prompt

Your task is to create 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;
int k;
long long ans[10009];
bool chk(long long n) {
  int m = 0;
  while (n) {
    m += (n % 10);
    n /= 10;
    if (m > 10) return 0;
  }
  return (m == 10);
}
int main() {
  cin >> k;
  ans[0] = 19;
  for (int i = 1; i <= 10000; i++) {
    ans[i] = ans[i - 1] + 9;
    while (!chk(ans[i])) ans[i] += 9;
  }
  cout << ans[k - 1];
  return 0;
}

```