#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
typedef long long LL;

using namespace std;

const int N = 505;

int n, m = 256, w[20], st[N];

LL P, f[N][N], g[N][N], h[N], c[N];

vector<int> e[N];

LL mul(LL a, LL b) {
	a %= P, b %= P;
	return ((a * b - (LL)((long double)a * b / P) * P) % P + P) % P;
}

int main() {
	w[2] = 0, w[3] = 1, w[5] = 2, w[7] = 3;
	w[11] = 4, w[13] = 5, w[17] = 6, w[19] = 7;
	scanf("%d%lld", &n, &P);
	f[0][0] = 1;
	for (int i = 2; i <= n; i++) {
		int x = i, s = 0, t = 0;
		for (int j = 2; j <= x; j++) {
			if (x % j == 0) {
				if (j <= 19) s |= 1 << w[j];
				else t = j;
				while (x % j == 0) x /= j;
			}
		}
		if (t) e[t].push_back(i), st[i] = s;
		else {
			memcpy(g, f, sizeof g);
			for (int u = m - 1; ~u; u--) {
				for (int v = m - 1; ~v; v--) {
					if ((u & v) || !g[u][v]) continue;
					if (((u | s) & v) == 0) (f[u | s][v] += g[u][v]) %= P;
					if ((u & (v | s)) == 0) (f[u][v | s] += g[u][v]) %= P;
				}
			}
		}
	}
	

	for (int i = 2; i <= n; i++) {
		if (!e[i].size()) continue; 
		memcpy(g, f, sizeof g);
		memset(h, 0, sizeof h);
		h[0] = 1;
		for (int j = 0; j < e[i].size(); j++) {
			int s = st[e[i][j]];
			memcpy(c, h, sizeof c);
			for (int k = m - 1; ~k; k--)
				(h[k | s] += c[k]) %= P;
		}

		h[0] = (h[0] + P - 1) % P;  
		for (int s = 0; s < m; s++) {
			if (!h[s]) continue;
			for (int u = m - 1; ~u; u--) {
				for (int v = m - 1; ~v; v--) {
					if ((u & v)) continue;
					if (((u | s) & v) == 0) f[u | s][v] = (f[u | s][v] + mul(g[u][v], h[s])) % P;
					if (((v | s) & u) == 0) f[u][v | s] = (f[u][v | s] + mul(g[u][v], h[s])) % P;
				}
			}
		}
	}	

	

	
	LL ans = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			if (!(i & j)) {
				(ans += f[i][j]) %= P;
			}
		}
	}
	
	printf("%lld\n", ans);
	return 0;
}