#include <bits/stdc++.h>
using namespace std;
int main() {
  int ans = 19;
  int i = 1;
  int k;
  cin >> k;
  for (i = 1; i < k;) {
    ans = ans + 9;
    int q = ans, r = 0;
    while (q != 0) {
      r = r + q % 10;
      q = q / 10;
    }
    if (r == 10) i++;
  }
  cout << ans;
  return 0;
}

### Prompt

Your task is to create a cpp solution 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 main() {
  int ans = 19;
  int i = 1;
  int k;
  cin >> k;
  for (i = 1; i < k;) {
    ans = ans + 9;
    int q = ans, r = 0;
    while (q != 0) {
      r = r + q % 10;
      q = q / 10;
    }
    if (r == 10) i++;
  }
  cout << ans;
  return 0;
}

```