#include <bits/stdc++.h>
using namespace std;
int prime[1 << 20];
int numofprimes;
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
int POWER(int x, int y, int m) {
  if (y == 0) return 1;
  if (y % 2 == 0) {
    int temp = POWER(x, y / 2, m);
    temp *= temp;
    temp %= m;
    return temp;
  }
  int temp = POWER(x, y - 1, m);
  temp *= x;
  temp %= m;
  return temp;
}
void runEratosthenesSieve(int upperBound) {
  int upperBoundSquareRoot = (int)sqrt((double)upperBound);
  bool *isComposite = new bool[upperBound + 1];
  memset(isComposite, 0, sizeof(bool) * (upperBound + 1));
  for (int m = 2; m <= upperBoundSquareRoot; m++) {
    if (!isComposite[m]) {
      prime[numofprimes++] = m;
      for (int k = m * m; k <= upperBound; k += m) isComposite[k] = true;
    }
  }
  for (int m = upperBoundSquareRoot + 1; m <= upperBound; m++)
    if (!isComposite[m]) prime[numofprimes++];
}
int main() {
  int n;
  cin >> n;
  long long int st = 1;
  for (long long int i = 1;; i += 5) {
    long long int s = 5;
    long long int cnt = 0;
    while (s <= i) {
      cnt += i / s;
      s *= 5;
    }
    if (cnt > n) {
      cout << 0 << '\n';
      return 0;
    }
    if (cnt == n) {
      cout << 5 << '\n';
      cout << i - 1 << " " << i << " " << i + 1 << " " << i + 2 << " " << i + 3
           << '\n';
      return 0;
    }
  }
}
