#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f=fopen("pascal.in","r");
FILE *g=fopen("pascal.out","w");
int F[3];
int E[3];
int D;
int R;
void desc(int D)
{
    for(int j=2;j*j<=D;j++)
    {
        if(D%j==0)
        {
            F[0]++;
            F[F[0]]=j;
            while(D%j==0)
            {
                D/=j;
                E[F[0]]++;
            }
        }
    }
    if(D!=1||(D==1&&F[0]==0))
    {
        F[0]++;F[F[0]]=D;E[F[0]]=1;
    }
}
int C(int N,int K)
{
    int R={1<<30};
    for(int i=1;i<=F[0];i++)
    {
        int p1=F[i],a=0,b=0;
        while(p1<=N)
        {
            a+=N/p1;
            p1*=F[i];
        }
        a/=E[i];
        p1=F[i];
        while(p1<=K)
        {
            b+=K/p1;
            p1*=F[i];
        }
        p1=F[i];
        while(p1<=N-K)
        {
            b+=(N-K)/p1;
            p1*=F[i];
        }
        b/=E[i];
        a-=b;
        R=min(R,a);
    }
    return R;
}
int main()
{
    fscanf(f,"%d %d",&R,&D);
    if(D==1){fprintf(g,"%d",R+1);return 0;}
    desc(D);
    int rez=0;
    for(int i=0;i<=R/2+R%2;i++)
    {
        if(C(R,i)>0)
            rez+=1+(R-i!=i);
    }
    fprintf(g,"%d",rez);
    fclose(f);
    fclose(g);
    return 0;
}