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

### 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;
int sum(long int c) {
  int somme = 0;
  while (c) {
    somme = somme + c % 10;
    c = c / 10;
  }
  return (somme);
}
int main() {
  long int k, c = 19;
  cin >> k;
  while (k) {
    if (sum(c) == 10) k--;
    c += 9;
  }
  cout << c - 9;
  return 0;
}

```