#include <bits/stdc++.h>
using namespace std;
int ten(int i) {
  int cnt = 0;
  while (i != 0) {
    cnt += (i % 10);
    i /= 10;
  }
  return cnt;
}
int main(void) {
  int k, i;
  long long ans = 18;
  cin >> k;
  while (k != 0) {
    ans++;
    if (ten(ans) == 10) k--;
  }
  cout << ans;
}

### 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 ten(int i) {
  int cnt = 0;
  while (i != 0) {
    cnt += (i % 10);
    i /= 10;
  }
  return cnt;
}
int main(void) {
  int k, i;
  long long ans = 18;
  cin >> k;
  while (k != 0) {
    ans++;
    if (ten(ans) == 10) k--;
  }
  cout << ans;
}

```