#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = 1e16;
const long long ninf = LLONG_MIN;
const double eps = 1e-12;
const long long N = 1000005;
const double PI = 3.14159265358979323846;
const long long LOGN = 19;
long long solve(long long x) {
  long long ans = 0;
  long long c = 5;
  while ((x / c) > 0) {
    ans += x / c;
    c *= 5;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long m;
  cin >> m;
  long long l = 0, r = 1e15, st = -1, ed = -1;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long curr = solve(mid);
    if (curr == m) {
      st = mid;
      r = mid - 1;
    } else if (curr < m) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  if (st == -1) {
    cout << "0\n";
    return 0;
  }
  l = 0;
  r = 1e15;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long curr = solve(mid);
    if (curr == m) {
      ed = mid;
      l = mid + 1;
    } else if (curr < m) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  cout << ed - st + 1 << "\n";
  for (long long i = st; i <= ed; i++) {
    cout << i << " ";
  }
  cout << "\n";
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?

Input

The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.

Output

First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.

Examples

Input

1


Output

5
5 6 7 8 9 

Input

5


Output

0

Note

The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n.

In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = 1e16;
const long long ninf = LLONG_MIN;
const double eps = 1e-12;
const long long N = 1000005;
const double PI = 3.14159265358979323846;
const long long LOGN = 19;
long long solve(long long x) {
  long long ans = 0;
  long long c = 5;
  while ((x / c) > 0) {
    ans += x / c;
    c *= 5;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long m;
  cin >> m;
  long long l = 0, r = 1e15, st = -1, ed = -1;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long curr = solve(mid);
    if (curr == m) {
      st = mid;
      r = mid - 1;
    } else if (curr < m) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  if (st == -1) {
    cout << "0\n";
    return 0;
  }
  l = 0;
  r = 1e15;
  while (l <= r) {
    long long mid = (l + r) / 2;
    long long curr = solve(mid);
    if (curr == m) {
      ed = mid;
      l = mid + 1;
    } else if (curr < m) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  cout << ed - st + 1 << "\n";
  for (long long i = st; i <= ed; i++) {
    cout << i << " ";
  }
  cout << "\n";
  return 0;
}

```