#include<bits/stdc++.h>
using namespace std;
#define int long long 
int n, p, ans, cs[30], vis[30];
void dfs(int x) {
	if(x == n + 1) {
		for(int i = 2; i <= n; i ++) {
			if(cs[i] <= cs[i / 2]) {
				return ;
			}
		}
		ans ++;
		return ;
	}
	for(int i = 1; i <= n; i ++) {
		if(!vis[i] && i > cs[x / 2]) {
			vis[i] = 1;
			cs[x] = i;
			dfs(x + 1);
			vis[i] = 0;
		}
	}
}
signed main() {
	freopen("countzj.in", "r", stdin);
	freopen("countzj.out", "w", stdout);
	cin >> n >> p;
	dfs(1);
	cout << ans % p;
    return 0;
}