#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
long long int n, a[10000005], b[10000005];
vector<long long int> v;
void solve() {
  long long int i, j, sum = 0, q;
  for (i = 1; i < 10000005; i++) {
    q = i;
    if (i == 1) {
      a[i] = 0;
      b[i] = 0;
    } else {
      a[i] = a[i - 1];
      b[i] = b[i - 1];
    }
    while (q > 0 && q % 2 == 0) {
      a[i]++;
      q /= 2;
    }
    while (q > 0 && q % 5 == 0) {
      b[i]++;
      q /= 5;
    }
  }
  for (i = 0; i < 10000005; i++) {
    if (min(a[i], b[i]) == n) {
      v.push_back(i);
      sum++;
    }
  }
  printf("%I64d\n", sum);
  for (i = 0; i < sum; i++) {
    printf("%I64d ", v[i]);
  }
  return;
}
int main() {
  scanf("%I64d", &n);
  solve();
  return 0;
}
