#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int dp[100000];
  long long int x = 19;
  dp[0] = 19;
  int k = 1;
  for (int i = 2; i <= 10000000; i++) {
    x += 9;
    long long int temp = x;
    int sum = 0;
    while (temp > 0) {
      sum += (temp % 10);
      temp /= 10;
    }
    if (sum == 10) {
      dp[k] = x;
      k++;
    }
  }
  cout << dp[n - 1] << "\n";
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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 n;
  cin >> n;
  int dp[100000];
  long long int x = 19;
  dp[0] = 19;
  int k = 1;
  for (int i = 2; i <= 10000000; i++) {
    x += 9;
    long long int temp = x;
    int sum = 0;
    while (temp > 0) {
      sum += (temp % 10);
      temp /= 10;
    }
    if (sum == 10) {
      dp[k] = x;
      k++;
    }
  }
  cout << dp[n - 1] << "\n";
}

```