#include <bits/stdc++.h>
using namespace std;
int getSumDigits(int n) {
  int sum = 0;
  for (int i = n; i > 0; i /= 10) sum += i % 10;
  return sum;
}
int main() {
  int k, c = 0;
  cin >> k;
  for (int i = 10;; i++) {
    if (getSumDigits(i) == 10) c++;
    if (c == k) {
      cout << i;
      break;
    }
  }
}

### 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;
int getSumDigits(int n) {
  int sum = 0;
  for (int i = n; i > 0; i /= 10) sum += i % 10;
  return sum;
}
int main() {
  int k, c = 0;
  cin >> k;
  for (int i = 10;; i++) {
    if (getSumDigits(i) == 10) c++;
    if (c == k) {
      cout << i;
      break;
    }
  }
}

```