#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int k;
  cin >> k;
  long long int j;
  long long int z = 19;
  long long int s;
  long long int p;
  long long int c = 0;
  for (j = z; j < j + 1; j++) {
    s = 0;
    p = j;
    while (p != 0) {
      s = s + (p % 10);
      p = p / 10;
    }
    if (s == 10) {
      c++;
    }
    if (c == k) {
      cout << j;
      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() {
  long long int k;
  cin >> k;
  long long int j;
  long long int z = 19;
  long long int s;
  long long int p;
  long long int c = 0;
  for (j = z; j < j + 1; j++) {
    s = 0;
    p = j;
    while (p != 0) {
      s = s + (p % 10);
      p = p / 10;
    }
    if (s == 10) {
      c++;
    }
    if (c == k) {
      cout << j;
      break;
    }
  }
  return 0;
}

```