#include <bits/stdc++.h>
int main() {
  int n;
  scanf("%d", &n);
  int i = 10, s, cnt = 0;
  while (1) {
    int t = i;
    s = 0;
    while (t > 0) {
      int x = t % 10;
      s += x;
      t /= 10;
    }
    if (s == 10) cnt++;
    if (cnt == n) {
      printf("%d", i);
      break;
    }
    i++;
  }
}

### 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>
int main() {
  int n;
  scanf("%d", &n);
  int i = 10, s, cnt = 0;
  while (1) {
    int t = i;
    s = 0;
    while (t > 0) {
      int x = t % 10;
      s += x;
      t /= 10;
    }
    if (s == 10) cnt++;
    if (cnt == n) {
      printf("%d", i);
      break;
    }
    i++;
  }
}

```