using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray(); static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray(); static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = long.Parse(ReadLine()); var fifth = new List(); var tmp = n; while (tmp > 0) { fifth.Add((int)(tmp % 5)); tmp /= 5; } for (var i = 0; i < fifth.Count; ++i) { while (fifth[i] > 2) { fifth[i] -= 5; if (i + 1 == fifth.Count) { fifth.Add(1); } else { ++fifth[i + 1]; } } } fifth.Reverse(); var offset = fifth.Count * 2 + 4; var len = offset * 2 + 1; var dp = new long[fifth.Count][]; var dpe = new long[fifth.Count]; for (var i = 0; i < fifth.Count; ++i) { dp[i] = new long[len]; if (i == 0) { for (var d = 1; d < fifth[0]; ++d) dp[0][d + offset] = 1; dpe[0] = fifth[0] + offset; } else { dp[i][offset + 1] = 1; dp[i][offset + 2] = 1; for (var j = 0; j < dp[i].Length; ++j) for (var d = -2; d <= 2; ++d) { if (j + d < 0 || j + d >= dp[i].Length) continue; dp[i][j + d] += dp[i - 1][j]; } for (var d = -2; d < fifth[i]; ++d) ++dp[i][dpe[i - 1] + d]; dpe[i] = dpe[i - 1] + fifth[i]; } } WriteLine(dp[^1][offset] + (dpe[^1] == offset ? 1 : 0)); } }