#include <bits/stdc++.h>
using namespace std;
string str;
int a[10005];
int b[6];
void init() {
  int sum, k, I;
  int l = 1;
  for (int i = 19;; i++) {
    sum = 0;
    I = i;
    k = 1;
    while (I) {
      b[k] = I % 10;
      sum += b[k];
      if (sum > 10) break;
      I /= 10;
      k++;
    }
    if (sum == 10) a[l++] = i;
    if (l > 10000) return;
  }
}
int main() {
  int n;
  init();
  while (scanf("%d", &n) != EOF) {
    printf("%d\n", a[n]);
  }
}

### 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;
string str;
int a[10005];
int b[6];
void init() {
  int sum, k, I;
  int l = 1;
  for (int i = 19;; i++) {
    sum = 0;
    I = i;
    k = 1;
    while (I) {
      b[k] = I % 10;
      sum += b[k];
      if (sum > 10) break;
      I /= 10;
      k++;
    }
    if (sum == 10) a[l++] = i;
    if (l > 10000) return;
  }
}
int main() {
  int n;
  init();
  while (scanf("%d", &n) != EOF) {
    printf("%d\n", a[n]);
  }
}

```