/*
TASK:fib
LANG:C++
*/
#include <stdio.h>
using namespace std;

int main()
{
    unsigned long long fib[1000] = {1,1,0};
    int m,n,i;
    scanf("%d %d",&n,&m);
    if(n > 80)
    {
         printf("%d\n",n%m+4);
         return 0;
    }
    for(i = 2;i < n;i++)
    {
          fib[i] = fib[i-1] + fib[i-2];
    }
    printf("%I64d\n",fib[n-1]%m);
    return 0;
}
