#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int M = 4e6 + 7;
const int lim = 1e6;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
multiset<long long> ms;
priority_queue<int> pq;
int a[N];
int main() {
  int n, cnt = 0, num = 19;
  scanf("%d", &n);
  while (cnt <= n) {
    int x = num, sum = 0;
    while (x) {
      sum += x % 10;
      x /= 10;
    }
    if (sum == 10) a[++cnt] = num;
    num += 9;
  }
  printf("%d\n", a[n]);
  return 0;
}

### Prompt

Please formulate 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;
const int N = 1e6 + 7;
const int M = 4e6 + 7;
const int lim = 1e6;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
multiset<long long> ms;
priority_queue<int> pq;
int a[N];
int main() {
  int n, cnt = 0, num = 19;
  scanf("%d", &n);
  while (cnt <= n) {
    int x = num, sum = 0;
    while (x) {
      sum += x % 10;
      x /= 10;
    }
    if (sum == 10) a[++cnt] = num;
    num += 9;
  }
  printf("%d\n", a[n]);
  return 0;
}

```