using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static long[] NList => ReadLine().Split().Select(long.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, m) = (c[0], c[1]); var divcount = GetDivCount(n, m); if (n < 10000) { var count = new int[n + 1]; for (var i = 2; i <= n; ++i) count[i] = 1; for (var i = n; i > 3; --i) { for (var j = 2; j * j <= i; ++j) { if (i % j == 0) { count[i / j] += count[i]; count[j] += count[i]; count[i] = 0; break; } } } var log = 0.0; for (var i = 2; i <= n; ++i) if (count[i] > 0) { log += Math.Log10(i) * count[i]; } if (divcount > 0) log -= Math.Log10(m) * divcount; Output(log); } else { var log = Math.Log10(2 * Math.PI * n) / 2 + Math.Log10(n / Math.E) * n - Math.Log10(m) * divcount; Output(log); } } static void Output(double log) { var d = Math.Floor(log); var rest = log - d; WriteLine($"{Math.Pow(10, rest):0.0000}e{d}"); } static long GetDivCount(long n, long m) { var mdiv = PDiv(m); var ans = long.MaxValue; foreach (var kv in mdiv) { var sub = 0L; var tmp = kv.Key; while (true) { sub += n / tmp; try { checked { tmp *= kv.Key; } } catch { break; } } ans = Math.Min(ans, sub / kv.Value); } return ans; } static Dictionary PDiv(long n) { var dic = new Dictionary(); var tmp = n; while (tmp % 2 == 0) { tmp /= 2; if (dic.ContainsKey(2)) ++dic[2]; else dic.Add(2, 1); } for (var p = 3L; p * p <= n; p += 2) { while (tmp % p == 0) { tmp /= p; if (dic.ContainsKey(p)) ++dic[p]; else dic.Add(p, 1); } if (tmp == 1) break; } if (tmp > 1) dic.Add(tmp, 1); return dic; } }