#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  int c = 1, sum = 0, temp;
  int per = 19;
  while (c < k) {
    per += 9;
    temp = per;
    sum = 0;
    while (temp != 0) {
      sum += temp % 10;
      temp /= 10;
    }
    if (sum == 10) {
      c++;
    }
  }
  cout << per << endl;
  return 0;
}

### Prompt

Generate 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 main() {
  int k;
  cin >> k;
  int c = 1, sum = 0, temp;
  int per = 19;
  while (c < k) {
    per += 9;
    temp = per;
    sum = 0;
    while (temp != 0) {
      sum += temp % 10;
      temp /= 10;
    }
    if (sum == 10) {
      c++;
    }
  }
  cout << per << endl;
  return 0;
}

```