#include<cstdio>


using ll=long long;


ll fib(int n, ll m)
{
	ll f[n+1]={0, 0, 1};

	for(int i=3;i<=n;i++)
	{
		f[i]=(f[i-1]+f[i-2])%m;
	}
	return f[n];
}


int main(void)
{
	int n, m;

	while(scanf("%d%d", &n, &m)==2)
	{
		printf("%lld\n", fib(n, m));
	}

	return 0;
}