#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n = 19, k, i = 1;
  cin >> k;
  while (i != k) {
    n += 9;
    int m = n, s = 0;
    while (m != 0) {
      s += m % 10;
      m = m / 10;
    }
    if (s == 10) {
      i++;
    }
  }
  cout << n;
}

### 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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n = 19, k, i = 1;
  cin >> k;
  while (i != k) {
    n += 9;
    int m = n, s = 0;
    while (m != 0) {
      s += m % 10;
      m = m / 10;
    }
    if (s == 10) {
      i++;
    }
  }
  cout << n;
}

```