import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long solve(int n, int[] as) {
  const offset = 2 * n;
  auto dp = new long[][][](n + 1, 2, 4 * n + 1);
  dp[n][0][offset + 0] = 1;
  foreach_reverse (i; 0 .. n) {
    foreach (s; 0 .. 2) {
      foreach (x; -2 * n .. +2 * n + 1) {
        if (dp[i + 1][s][offset + x]) {
          foreach (d; -2 .. +2 + 1) {
            if (s || d <= as[i]) {
              dp[i][(s || d < as[i]) ? 1 : 0][offset + x + d] += dp[i + 1][s][offset + x];
            }
          }
        }
      }
    }
  }
  long ret;
  foreach (s; 0 .. 2) {
    ret += dp[0][s][offset + 0];
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      const N = readLong();
      
      int[] as;
      for (long n = N; n != 0; ) {
        int r = cast(int)(n % 5);
        for (; r < -2; r += 5) {}
        for (; r > +2; r -= 5) {}
        as ~= r;
        n = (n - r) / 5;
      }
      debug {
        writeln("as = ", as);
      }
      const asLen = cast(int)(as.length);
      
      long ans;
      ans += solve(asLen, as);
      ans -= solve(asLen, new int[asLen]);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}