#include <bits/stdc++.h>
using namespace std;
long long int cal(long long int n) {
  long long int ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
void solve() {
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    long long int num = 1;
    while (n) {
      if (cal(num) == 10) n--;
      num++;
    }
    cout << num - 1 << endl;
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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;
long long int cal(long long int n) {
  long long int ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
void solve() {
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    long long int num = 1;
    while (n) {
      if (cal(num) == 10) n--;
      num++;
    }
    cout << num - 1 << endl;
  }
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}

```