#include <bits/stdc++.h>
using namespace std;
int num[10005];
int main() {
  int k;
  cin >> k;
  int sum, t, rem, c = 0, ans, i = 1;
  while (c != k) {
    sum = 0;
    t = i;
    while (t) {
      rem = t % 10;
      sum += rem;
      t = t / 10;
    }
    if (sum == 10) {
      num[c + 1] = i;
      c++;
    }
    i++;
  }
  int j = k;
  while (j) {
    if (j >= 1 && num[j] != 0) {
      cout << num[j] << endl;
      break;
    } else
      j--;
  }
}

### 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 num[10005];
int main() {
  int k;
  cin >> k;
  int sum, t, rem, c = 0, ans, i = 1;
  while (c != k) {
    sum = 0;
    t = i;
    while (t) {
      rem = t % 10;
      sum += rem;
      t = t / 10;
    }
    if (sum == 10) {
      num[c + 1] = i;
      c++;
    }
    i++;
  }
  int j = k;
  while (j) {
    if (j >= 1 && num[j] != 0) {
      cout << num[j] << endl;
      break;
    } else
      j--;
  }
}

```