#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class T1, class T2, class T3, class T4>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {
  gn(x1, x2), gn(x3, x4);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
int f[2000000];
int p[2000000], np;
int main() {
  for (int i = 2; i < 2000000; i++)
    if (!f[i]) {
      p[np++] = i;
      if ((long long)i * i >= 2000000) continue;
      for (int j = i * i; j < 2000000; j += i) f[j] = 1;
    }
  long long n, first, ans = 9223372036854775807LL;
  gn(n, first);
  for (int i = 0; i < np && first > 1; i++)
    if (first % p[i] == 0) {
      long long num = 0;
      while (first > 1 && first % p[i] == 0) {
        first /= p[i];
        num++;
      }
      double d = 1;
      long long u = 1, sum = 0;
      while (1) {
        d *= p[i];
        if (d > n) break;
        u *= p[i];
        sum += n / u;
      }
      smin(ans, sum / num);
    }
  if (first > 1) {
    double d = 1;
    long long u = 1, sum = 0;
    while (1) {
      d *= first;
      if (d > n) break;
      u *= first;
      sum += n / u;
    }
    smin(ans, sum);
  }
  print(ans);
}
