#include <bits/stdc++.h>
using namespace std;
int dp[10005];
int main() {
  int in = 0;
  for (int i = 19; i <= 10800100; i++) {
    int len = log10(i) + 1;
    int s = 0, t = i;
    for (int j = 1; j <= len; j++) {
      s += t % 10;
      t /= 10;
      if (s > 10) break;
    }
    if (s == 10) {
      in++;
      dp[in] = i;
    }
  }
  int k;
  cin >> k;
  cout << dp[k] << endl;
  return 0;
}

### 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 dp[10005];
int main() {
  int in = 0;
  for (int i = 19; i <= 10800100; i++) {
    int len = log10(i) + 1;
    int s = 0, t = i;
    for (int j = 1; j <= len; j++) {
      s += t % 10;
      t /= 10;
      if (s > 10) break;
    }
    if (s == 10) {
      in++;
      dp[in] = i;
    }
  }
  int k;
  cin >> k;
  cout << dp[k] << endl;
  return 0;
}

```