#include <bits/stdc++.h>
using namespace std;
long long int cal(long long int n) {
  long long int s = 0;
  while (n) {
    s += n % 10;
    n /= 10;
  }
  return s;
}
int main() {
  long long int t, s = 0;
  cin >> t;
  long long int n = t;
  while (t) {
    s++;
    if (cal(s) == 10) t--;
  }
  cout << s << endl;
}

### Prompt

Develop a solution in cpp to the problem described below:

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;
long long int cal(long long int n) {
  long long int s = 0;
  while (n) {
    s += n % 10;
    n /= 10;
  }
  return s;
}
int main() {
  long long int t, s = 0;
  cin >> t;
  long long int n = t;
  while (t) {
    s++;
    if (cal(s) == 10) t--;
  }
  cout << s << endl;
}

```