#include <bits/stdc++.h>
using namespace std;
vector<long long> a;
long long sum(long long n) {
  long long res = 0;
  while (n > 0) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
signed main() {
  long long i = 19;
  long long j = 1;
  while (j < 10002) {
    if (sum(i) == 10) {
      a.push_back(i);
      j++;
    }
    i++;
  }
  long long n;
  cin >> n;
  cout << a[n - 1];
  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;
vector<long long> a;
long long sum(long long n) {
  long long res = 0;
  while (n > 0) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
signed main() {
  long long i = 19;
  long long j = 1;
  while (j < 10002) {
    if (sum(i) == 10) {
      a.push_back(i);
      j++;
    }
    i++;
  }
  long long n;
  cin >> n;
  cout << a[n - 1];
  return 0;
}

```