#include <iostream>
#include <cstring>
#include <algorithm>
#include <fstream>

using namespace std;

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

int n, a[10001][10001], k, contor;

int main() {

	f >> n >> k;

	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= i; j++)
			if (j == 0)
				a[i][j] = 1;
			else
				if (j == i)
					a[i][j] = 1;
				else
					a[i][j] = a[i - 1][j] + a[i - 1][j - 1];


	/*
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= i; j++)
			cout << a[i][j] << " ";
		cout << "\n";
	}
	*/

	for (int i = 0; i <= n; i++)
		if (!(a[n][i] % k))
			contor++;

	g << contor << "\n";


	return 0;
}