#include <bits/stdc++.h>
using namespace std;
bool cl(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first < b.first;
}
int gcd(int a, int b) {
  int c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
void task() {
  int index = 0, k;
  cin >> k;
  for (int i = 0; i < 11000000; ++i) {
    int d = i, s = 0;
    while (d > 0) {
      s += d % 10;
      d /= 10;
    }
    if (s == 10) {
      ++index;
      if (k == index) {
        cout << i;
        break;
      }
    }
  }
}
int main(void) { task(); }

### 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;
bool cl(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first < b.first;
}
int gcd(int a, int b) {
  int c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
void task() {
  int index = 0, k;
  cin >> k;
  for (int i = 0; i < 11000000; ++i) {
    int d = i, s = 0;
    while (d > 0) {
      s += d % 10;
      d /= 10;
    }
    if (s == 10) {
      ++index;
      if (k == index) {
        cout << i;
        break;
      }
    }
  }
}
int main(void) { task(); }

```