#include <bits/stdc++.h>
using namespace std;
int sum(int n) {
  int ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  if (ans == 10) {
    return true;
  } else {
    return false;
  }
}
int main() {
  long long n;
  cin >> n;
  for (long long i = 19;; i++) {
    if (sum(i) == true) {
      n--;
    }
    if (n == 0) {
      cout << i;
      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 sum(int n) {
  int ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  if (ans == 10) {
    return true;
  } else {
    return false;
  }
}
int main() {
  long long n;
  cin >> n;
  for (long long i = 19;; i++) {
    if (sum(i) == true) {
      n--;
    }
    if (n == 0) {
      cout << i;
      return 0;
    }
  }
}

```