#include <bits/stdc++.h>
#define NM 5000005
using namespace std;
ifstream fin ("pascal.in");
ofstream fout ("pascal.out");
unsigned long long n, d, nr, dp[2][NM];
int main()
{
    fin >> n >> d;
    if(n == 0)
    {
        fout << 0;
        return 0;
    }
    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-1])%d;
    for(int i=1; i<=n+1; i++)
        if(dp[(n+1)%2][i] == 0)
            nr++;
    fout << nr;
    return 0;
}