#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  int cnt = 0;
  for (unsigned long long i = 19;; i++) {
    unsigned long long j = i;
    int val = 0;
    while (j > 0) val += j % 10, j /= 10;
    if (val == 10) cnt++;
    if (cnt == k) {
      cout << i << "\n";
      break;
    }
  }
  return 0;
}

### Prompt

In Cpp, your task is to solve 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 main() {
  int k;
  cin >> k;
  int cnt = 0;
  for (unsigned long long i = 19;; i++) {
    unsigned long long j = i;
    int val = 0;
    while (j > 0) val += j % 10, j /= 10;
    if (val == 10) cnt++;
    if (cnt == k) {
      cout << i << "\n";
      break;
    }
  }
  return 0;
}

```