#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, i = 18, j, temp, sum = 0;
  cin >> n;
  while (n) {
    i++;
    temp = i;
    sum = 0;
    while (temp) {
      sum += temp % 10;
      temp /= 10;
    }
    if (sum == 10) n--;
  }
  cout << i;
}

### Prompt

Please create a solution in CPP 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() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, i = 18, j, temp, sum = 0;
  cin >> n;
  while (n) {
    i++;
    temp = i;
    sum = 0;
    while (temp) {
      sum += temp % 10;
      temp /= 10;
    }
    if (sum == 10) n--;
  }
  cout << i;
}

```