#include <bits/stdc++.h>
using namespace std;
int sum(int digits) {
  int summation = 0;
  while (digits > 0) {
    int a = digits % 10;
    summation = summation + a;
    digits = digits / 10;
  }
  return (summation);
}
int main() {
  int k;
  cin >> k;
  int n = 19;
  int p;
  while (k) {
    if (sum(n) == 10) {
      p = n;
      k--;
    }
    n = n + 9;
  }
  cout << p;
}

### Prompt

Your task is to create 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 sum(int digits) {
  int summation = 0;
  while (digits > 0) {
    int a = digits % 10;
    summation = summation + a;
    digits = digits / 10;
  }
  return (summation);
}
int main() {
  int k;
  cin >> k;
  int n = 19;
  int p;
  while (k) {
    if (sum(n) == 10) {
      p = n;
      k--;
    }
    n = n + 9;
  }
  cout << p;
}

```