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

### 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 s(int k) {
  int sum = 0;
  while (k > 0) {
    sum += k % 10;
    k /= 10;
  }
  if (sum == 10)
    return 1;
  else
    return (-1);
}
int main() {
  int a;
  cin >> a;
  int i = 1;
  int k = 19;
  while (i < a) {
    k += 9;
    if (s(k) == 1) i++;
  }
  cout << k;
  return 0;
}

```