#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-8;
const long double PI = acosl(-1.0);
int sum(int n) {
  int res = 0;
  while (n) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int k;
  cin >> k;
  for (int i = 0, n = 0; i < k; n++) {
    if (sum(n) == 10) {
      i++;
      if (i == k) {
        cout << n;
        break;
      }
    }
  }
  return 0;
}

### Prompt

In Cpp, your task is to solve 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;
const long double EPS = 1e-8;
const long double PI = acosl(-1.0);
int sum(int n) {
  int res = 0;
  while (n) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int k;
  cin >> k;
  for (int i = 0, n = 0; i < k; n++) {
    if (sum(n) == 10) {
      i++;
      if (i == k) {
        cout << n;
        break;
      }
    }
  }
  return 0;
}

```