#include <bits/stdc++.h>
using namespace std;
void speed_cin() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void file() {
  freopen("sumy.in", "r", stdin);
  freopen("sumy.out", "w", stdout);
}
int main() {
  long long k;
  cin >> k;
  long long i = 19;
  while (k > 0) {
    long long n = 0;
    long long j = i;
    while (j > 0) {
      n += j % 10;
      j /= 10;
    }
    if (n == 10) {
      --k;
    }
    i++;
  }
  cout << i - 1;
}

### Prompt

Your task is to create 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;
void speed_cin() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void file() {
  freopen("sumy.in", "r", stdin);
  freopen("sumy.out", "w", stdout);
}
int main() {
  long long k;
  cin >> k;
  long long i = 19;
  while (k > 0) {
    long long n = 0;
    long long j = i;
    while (j > 0) {
      n += j % 10;
      j /= 10;
    }
    if (n == 10) {
      --k;
    }
    i++;
  }
  cout << i - 1;
}

```