#include <bits/stdc++.h>
using namespace std;
int modul(int n);
int mac(int n) {
  n += 9;
  if (modul(n) != 10) {
    n = mac(n);
  }
  return n;
}
int main() {
  int k;
  cin >> k;
  int a[k];
  a[0] = 19;
  for (int i = 1; i < k; i++) {
    a[i] = mac(a[i - 1]);
  }
  cout << a[k - 1];
}
int modul(int n) {
  int j = 0, i = n;
  do {
    j += i % 10;
    i = i / 10;
  } while (i > 0);
  return j;
}

### Prompt

Generate 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 modul(int n);
int mac(int n) {
  n += 9;
  if (modul(n) != 10) {
    n = mac(n);
  }
  return n;
}
int main() {
  int k;
  cin >> k;
  int a[k];
  a[0] = 19;
  for (int i = 1; i < k; i++) {
    a[i] = mac(a[i - 1]);
  }
  cout << a[k - 1];
}
int modul(int n) {
  int j = 0, i = n;
  do {
    j += i % 10;
    i = i / 10;
  } while (i > 0);
  return j;
}

```