#include <bits/stdc++.h>
#define NM 5000005
using namespace std;
ifstream fin ("pascal.in");
ofstream fout ("pascal.out");
int n, d, nr, fact[NM];//dp[2][NM]
int main()
{
    fin >> n >> d;
    fact[0] = 1;
    for(int i=1; i<=n; i++)
        fact[i] = fact[i-1]*i;

    for(int j=1; j<=n; j++)
    {
        unsigned long long x = fact[n]/fact[n-j]/fact[j];
        if(x%d == 0)
            nr++;
    }
    fout << nr;
    /*
    dp[1][1] = 1;
    for(int i=2; i<=n-1; i++)
        for(int j=1; j<=i; j++)
            dp[i%2][j] = (dp[(i-1)%2][j] + dp[(i-1)%2][j])%d;
    for(int i=1; i<=n-1; i++)
        if(dp[n%2][i] == 0)
            nr++;
    fout << nr;
    */
    return 0;
}