#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  vector<long long> v(10001, 0);
  long long j = 1;
  for (long long i = (long long)1; i <= (long long)t; i++) {
    bool b = true;
    while (b) {
      j++;
      string s = to_string(j);
      long long c = 0;
      for (long long i = (long long)0; i <= (long long)s.size() - 1; i++) {
        c += s[i] - '0';
      }
      if (c == 10) {
        v[i] = j;
        break;
      }
    }
  }
  cout << v[t];
}

### 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;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  vector<long long> v(10001, 0);
  long long j = 1;
  for (long long i = (long long)1; i <= (long long)t; i++) {
    bool b = true;
    while (b) {
      j++;
      string s = to_string(j);
      long long c = 0;
      for (long long i = (long long)0; i <= (long long)s.size() - 1; i++) {
        c += s[i] - '0';
      }
      if (c == 10) {
        v[i] = j;
        break;
      }
    }
  }
  cout << v[t];
}

```