#include <bits/stdc++.h>
using namespace std;
int main() {
  int s[10000];
  int a = 19;
  for (int i = 0; i < 10000; i++) {
    int c = 0, d = a;
    for (int j = 0; d > 0; j++) {
      c += d % 10;
      d = d / 10;
    }
    if (c == 10)
      s[i] = a;
    else
      i--;
    a += 9;
  }
  int k;
  cin >> k;
  cout << s[k - 1] << endl;
}

### Prompt

Generate 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() {
  int s[10000];
  int a = 19;
  for (int i = 0; i < 10000; i++) {
    int c = 0, d = a;
    for (int j = 0; d > 0; j++) {
      c += d % 10;
      d = d / 10;
    }
    if (c == 10)
      s[i] = a;
    else
      i--;
    a += 9;
  }
  int k;
  cin >> k;
  cout << s[k - 1] << endl;
}

```