#include <bits/stdc++.h>
using namespace std;
int sum(int N) {
  int ans = 0;
  while (N) {
    ans += N % 10;
    N /= 10;
  }
  return ans;
}
int main() {
  int N;
  cin >> N;
  int count = 0;
  int i = 1;
  for (; count != N; ++i)
    if (sum(i) == 10) ++count;
  cout << i - 1 << endl;
}

### 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 sum(int N) {
  int ans = 0;
  while (N) {
    ans += N % 10;
    N /= 10;
  }
  return ans;
}
int main() {
  int N;
  cin >> N;
  int count = 0;
  int i = 1;
  for (; count != N; ++i)
    if (sum(i) == 10) ++count;
  cout << i - 1 << endl;
}

```