#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n,P;
ll f[505][505];
ll nxt[505][505];
ll ans;

int main(){
	freopen("great.in","r",stdin);
	freopen("great.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>P;
	f[0][0]=1;
	for (int i=0;i<n;i++){
		for (int j=0;j<=i+1;j++){
			for (int k=0;k<=j;k++){
				nxt[j][k]=0;
			}
		}
		for (int j=0;j<=i;j++){
			for (int k=0;k<=j;k++){
				ll val=f[j][k];
				if (!val) continue;
				ll z=i-j-k;
				if (z<j) continue;
				nxt[j][k]=(nxt[j][k]+val)%P;
				if (z>=j+1){
					nxt[j+1][k]=(nxt[j+1][k]+val)%P;
				}
				if (j>=k+1){
					nxt[j][k+1]=(nxt[j][k+1]+val)%P;
				}
			}
		}
		for (int j=0;j<=i+1;j++){
			for (int k=0;k<=j;k++){
				f[j][k]=nxt[j][k];
			}
		}
	}
	for (int j=0;j<=n;j++){
		for (int k=0;k<=j;k++){
			ll z=n-j-k;
			if (z>=j){
				ll val=f[j][k];
				ans=(ans+val*val%P)%P;
			}
		}
	}
	cout<<ans<<'\n';
	return 0;
}