#include <bits/stdc++.h>
using namespace std;
bool check(long n) {
  int c = 0;
  while (n) {
    c += n % 10;
    n /= 10;
  }
  if (c == 10)
    return true;
  else
    return false;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  ;
  long temp = 19;
  while (n > 1) {
    temp += 9;
    if (check(temp)) n--;
  }
  cout << temp << '\n';
  return 0;
}

### Prompt

Please create a solution in Cpp 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 check(long n) {
  int c = 0;
  while (n) {
    c += n % 10;
    n /= 10;
  }
  if (c == 10)
    return true;
  else
    return false;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  ;
  long temp = 19;
  while (n > 1) {
    temp += 9;
    if (check(temp)) n--;
  }
  cout << temp << '\n';
  return 0;
}

```