#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp;
void luck() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
signed main() {
  long long n;
  cin >> n;
  long long ans = 19, cnt = 0;
  while (1) {
    long long tmp = ans, digitsum = 0;
    while (tmp > 0) {
      digitsum += tmp % 10;
      tmp /= 10;
    }
    if (digitsum == 10) {
      cnt++;
      if (cnt == n) break;
    }
    ans += 9;
  }
  cout << ans << " ";
  return 0;
}

### Prompt

In CPP, your task is to solve 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;
map<long long, long long> mp;
void luck() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
signed main() {
  long long n;
  cin >> n;
  long long ans = 19, cnt = 0;
  while (1) {
    long long tmp = ans, digitsum = 0;
    while (tmp > 0) {
      digitsum += tmp % 10;
      tmp /= 10;
    }
    if (digitsum == 10) {
      cnt++;
      if (cnt == n) break;
    }
    ans += 9;
  }
  cout << ans << " ";
  return 0;
}

```