#include <bits/stdc++.h>
using namespace std;
int arr[10005]{};
int main() {
  int a = 1;
  for (int i = 15; a < 10005; ++i) {
    int sum = 0;
    int num = i;
    while (num > 0) {
      sum += num % 10;
      num = num / 10;
    }
    if (sum == 10) {
      arr[a] = i;
      ++a;
    }
  }
  int n;
  cin >> n;
  cout << arr[n] << " \n";
  return 0;
}

### Prompt

Please provide a cpp coded solution 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 arr[10005]{};
int main() {
  int a = 1;
  for (int i = 15; a < 10005; ++i) {
    int sum = 0;
    int num = i;
    while (num > 0) {
      sum += num % 10;
      num = num / 10;
    }
    if (sum == 10) {
      arr[a] = i;
      ++a;
    }
  }
  int n;
  cin >> n;
  cout << arr[n] << " \n";
  return 0;
}

```