#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, sum = 0, s = 0, x;
  cin >> n;
  for (int i = 19; i < 1000000000; i++) {
    x = i;
    while (x != 0) {
      sum += x % 10;
      x /= 10;
    }
    if (sum == 10) {
      s++;
      if (s == n) {
        cout << i;
        break;
      }
    }
    sum = 0;
  }
  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 n, sum = 0, s = 0, x;
  cin >> n;
  for (int i = 19; i < 1000000000; i++) {
    x = i;
    while (x != 0) {
      sum += x % 10;
      x /= 10;
    }
    if (sum == 10) {
      s++;
      if (s == n) {
        cout << i;
        break;
      }
    }
    sum = 0;
  }
  return 0;
}

```