#include <bits/stdc++.h>
using namespace std;
int k10(long long k) {
  long long sum = 0;
  while (k) {
    sum += k % 10;
    k /= 10;
  }
  if (sum == 10)
    return 1;
  else
    return 0;
}
int main() {
  int k;
  cin >> k;
  long long temp = 0;
  for (int i = 0; i < k;) {
    if (k10(temp)) {
      i++;
    }
    temp += 1;
  }
  cout << temp - 1 << endl;
  return 0;
}

### Prompt

Please formulate 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 k10(long long k) {
  long long sum = 0;
  while (k) {
    sum += k % 10;
    k /= 10;
  }
  if (sum == 10)
    return 1;
  else
    return 0;
}
int main() {
  int k;
  cin >> k;
  long long temp = 0;
  for (int i = 0; i < k;) {
    if (k10(temp)) {
      i++;
    }
    temp += 1;
  }
  cout << temp - 1 << endl;
  return 0;
}

```