#include <bits/stdc++.h>
using namespace std;
int perfect(int a) {
  int sum = 0;
  while (a != 0) {
    sum = sum + a % 10;
    a = a / 10;
  }
  return sum;
}
int main() {
  vector<int> v;
  int k, cnt = 0;
  cin >> k;
  for (int i = 1; i <= 20000000; i = i + 9) {
    if (perfect(i) == 10) v.push_back(i);
  }
  cout << v[k - 1];
  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 perfect(int a) {
  int sum = 0;
  while (a != 0) {
    sum = sum + a % 10;
    a = a / 10;
  }
  return sum;
}
int main() {
  vector<int> v;
  int k, cnt = 0;
  cin >> k;
  for (int i = 1; i <= 20000000; i = i + 9) {
    if (perfect(i) == 10) v.push_back(i);
  }
  cout << v[k - 1];
  return 0;
}

```