#include <bits/stdc++.h>
using namespace std;
long long a[1000005];
int main() {
  long long k;
  long long m = 19;
  for (long long i = 1; i <= 10000;) {
    int sum = 0;
    long long n = m;
    while (n != 0) {
      sum = sum + n % 10;
      n = n / 10;
    }
    if (sum == 10) {
      a[i] = m;
      i++;
    }
    m++;
  }
  while (cin >> k) {
    cout << a[k] << endl;
  }
}

### 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;
long long a[1000005];
int main() {
  long long k;
  long long m = 19;
  for (long long i = 1; i <= 10000;) {
    int sum = 0;
    long long n = m;
    while (n != 0) {
      sum = sum + n % 10;
      n = n / 10;
    }
    if (sum == 10) {
      a[i] = m;
      i++;
    }
    m++;
  }
  while (cin >> k) {
    cout << a[k] << endl;
  }
}

```