#include <bits/stdc++.h>
using namespace std;
bool valid(long long int num) {
  int sum = 0;
  while (num) {
    sum += num % 10;
    num /= 10;
  }
  if (sum == 10) return 1;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  long long int first = 19;
  int cnt = 1;
  while (cnt < n) {
    first++;
    if (valid(first)) cnt++;
  }
  cout << first << endl;
  return 0;
}

### Prompt

Please formulate 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;
bool valid(long long int num) {
  int sum = 0;
  while (num) {
    sum += num % 10;
    num /= 10;
  }
  if (sum == 10) return 1;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  long long int first = 19;
  int cnt = 1;
  while (cnt < n) {
    first++;
    if (valid(first)) cnt++;
  }
  cout << first << endl;
  return 0;
}

```