#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
long long n,i,j,h,p1,p2,p3,a[1001][1001],d,k;
int main()
{
    fin>>n>>d;
    for(i=0;i<=n;i++)
       {
          p1=1;p2=1;p3=1;
       for(j=0;j<=i;j++)
    {
        if(i==0)
            a[i][j]=1;
        else
            a[i][j]=a[i-1][j-1]+a[i-1][j];
        if(i==n) if(a[i][j]%d==0) k++;
    }
       }
     fout<<k;
    return 0;
}