#include <bits/stdc++.h>
using namespace std;
bool sumd(long long int n) {
  long long int a = 0;
  while (n != 0) {
    a += n % 10;
    n /= 10;
  }
  if (a == 10) {
    return true;
  }
  return false;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  long long int c = 0, i = 1;
  while (1) {
    if (sumd(i)) {
      c++;
    }
    if (c == n) {
      cout << i;
      return 0;
    }
    i++;
  }
  return 0;
}

### Prompt

Your challenge is to write 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;
bool sumd(long long int n) {
  long long int a = 0;
  while (n != 0) {
    a += n % 10;
    n /= 10;
  }
  if (a == 10) {
    return true;
  }
  return false;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  long long int c = 0, i = 1;
  while (1) {
    if (sumd(i)) {
      c++;
    }
    if (c == n) {
      cout << i;
      return 0;
    }
    i++;
  }
  return 0;
}

```