#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int maxn = 1002;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int k;
  cin >> k;
  long long num = 19;
  long long count = 1;
  while (count < k) {
    num += 10;
    num--;
    long long copy = num;
    long long sum = 0;
    while (copy) {
      int dig = copy % 10;
      sum += dig;
      copy /= 10;
    }
    if (sum == 10) count++;
  }
  cout << num;
  return 0;
}

### Prompt

In cpp, your task is to solve 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;
const int N = 2e5 + 5;
const int maxn = 1002;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int k;
  cin >> k;
  long long num = 19;
  long long count = 1;
  while (count < k) {
    num += 10;
    num--;
    long long copy = num;
    long long sum = 0;
    while (copy) {
      int dig = copy % 10;
      sum += dig;
      copy /= 10;
    }
    if (sum == 10) count++;
  }
  cout << num;
  return 0;
}

```