#include <fstream>
using namespace std;

const long long INF = 1LL << 62; // Infinite value

int Fp[15], Ex[15], NF; // Decomposition of B into factors
long long Expf[15];

ifstream f("zero2.in");
ofstream g("zero2.out");

void desc(int n) {
    NF = 0;
    for (int d = 2; d * d <= n; d += (d == 2) ? 1 : 2) { // Increment by 2 after checking for 2
        if (n % d == 0) {
            NF++;
            Fp[NF] = d;
            Ex[NF] = 0;
            do {
                Ex[NF]++;
                n /= d;
            } while (n % d == 0);
        }
    }
    if (n > 1) { // n is prime
        NF++;
        Fp[NF] = n;
        Ex[NF] = 1;
    }
}

void expp(int N) {
    for (int i = 1; i <= NF; i++) {
        long long pp = Fp[i];
        Expf[i] = 0;
        while (N >= pp) {
            int k = N / pp;
            Expf[i] += pp * k * (k - 1) / 2;
            Expf[i] += (N - k * pp + 1) * k;
            pp *= Fp[i];
        }
    }
}

int main() {
    int N, B, t = 10;
    long long nrz;
    while (t--) {
        f >> N >> B;
        desc(B);
        expp(N);
        nrz = INF;
        for (int i = 1; i <= NF; i++) {
            nrz = min(nrz, Expf[i] / Ex[i]);
        }
        g << nrz << '\n';
    }
    f.close();
    g.close();
    return 0;
}