#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int i, j, k, l, n, m;
  cin >> n;
  l = 1;
  k = 19;
  while (l < n) {
    k += (long long int)9;
    long long int p = k;
    long long int rem = 0;
    while (p > 0) {
      rem += p % 10;
      p /= 10;
    }
    if (rem % 10 == 0) l++;
  }
  cout << k;
}

### Prompt

Your challenge is to write 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 main() {
  long long int i, j, k, l, n, m;
  cin >> n;
  l = 1;
  k = 19;
  while (l < n) {
    k += (long long int)9;
    long long int p = k;
    long long int rem = 0;
    while (p > 0) {
      rem += p % 10;
      p /= 10;
    }
    if (rem % 10 == 0) l++;
  }
  cout << k;
}

```