#include <iostream>
#include <queue>
#include <algorithm>
#include <fstream>
#define MAX 1000001

using namespace std;

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

long long int R, D, nr = 0;;

int binomial(int n, int k) {
	if (k == 0 || k == n)return 1;
	else return binomial(n - 1, k - 1) + binomial(n - 1, k);
}

int main() {
	in >> R >> D;
	for (int i = 0; i <= (R + 1) / 2 + 1; i++) {
		if (binomial(R, i) % D == 0) nr++;
	}
	out << nr;

}