#include <bits/stdc++.h>
using namespace std;
int sum(long long int k) {
  long long int sum = 0;
  while (k != 0) {
    sum += k % 10;
    k = k / 10;
  }
  if (sum == 10)
    return 1;
  else
    return 0;
}
int main() {
  ios::sync_with_stdio(false);
  int k;
  cin >> k;
  long long int c = 1;
  int count = 0;
  while (1) {
    if (sum(c)) {
      count++;
    }
    if (count == k) break;
    c += 9;
  }
  cout << c << endl;
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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(long long int k) {
  long long int sum = 0;
  while (k != 0) {
    sum += k % 10;
    k = k / 10;
  }
  if (sum == 10)
    return 1;
  else
    return 0;
}
int main() {
  ios::sync_with_stdio(false);
  int k;
  cin >> k;
  long long int c = 1;
  int count = 0;
  while (1) {
    if (sum(c)) {
      count++;
    }
    if (count == k) break;
    c += 9;
  }
  cout << c << endl;
  return 0;
}

```