#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = 2 * acos((long double)0);
long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
void setmin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void setmax(T& a, T val) {
  if (a < val) a = val;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
long long calc(long long k) {
  long long res = 0;
  while (k) {
    res += k / 5;
    k /= 5;
  }
  return res;
}
void solve() {
  long long m;
  cin >> m;
  int cur = 1;
  vector<int> ans;
  while (1) {
    long long d = calc(cur);
    if (d == m)
      ans.push_back(cur);
    else if (d > m)
      break;
    cur++;
  }
  cout << int((ans).size()) << "\n";
  for (int i = (0); i < (int((ans).size())); i++) cout << ans[i] << " ";
}
int main() {
  solve();
  return 0;
}
