#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long int k, t, pos;
long long int sm(long long int x) {
  long long int y = x, ra = 0;
  while (y != 0) ra += y % 10, y /= 10;
  return ra;
}
int main() {
  cin >> k;
  while (1) {
    if (sm(pos) == 10) t++;
    if (t == k) break;
    pos++;
  }
  cout << pos << "\n";
  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;
void fast() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long int k, t, pos;
long long int sm(long long int x) {
  long long int y = x, ra = 0;
  while (y != 0) ra += y % 10, y /= 10;
  return ra;
}
int main() {
  cin >> k;
  while (1) {
    if (sm(pos) == 10) t++;
    if (t == k) break;
    pos++;
  }
  cout << pos << "\n";
  return 0;
}

```