#include<stdio.h>
#include<iostream>
using namespace std;
#define maxnn 2000100
#define ll long long
ll zhi[maxnn];
ll n,p;
ll phi[maxnn];
ll cnt[maxnn];
ll len=0;
ll is[maxnn];
void init()
{
    phi[1]=1;
    for(ll i=2;i<=2000000;i++)
    {
        if(!phi[i])
            zhi[++len]=i;
        for(int j=1;j<=len&&zhi[j]*i<=2000000;j++)
        {
            phi[zhi[j]*i]=1;
            if(i%zhi[j]==0) break;
        }
    }
}
void iiit(){
  
    for(ll i=2*n;i>=1;i--)
    {
        if(is[i])
    {
        if(zhi[lower_bound(zhi+1,zhi+len+1,i)-zhi]==i) continue;
        for(int j=2;j*j<=i;j++)
        {
            if(i%j==0)
            {
                is[j]+=is[i];
                is[i/j]+=is[i];
                break;
            }
        }
    }
    }
    for(int i=1;i<=len&&zhi[i]<=2*n;i++)
    {
        if(is[zhi[i]]) cnt[zhi[i]]+=is[zhi[i]];
    }
}
ll ksm(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1) ans=ans*a%p;
        a=a*a%p;
        b>>=1;
    }
    return ans;
}
int main(){
    cin>>n>>p;
    for(ll i=n+2;i<=2*n;i++) is[i]=1;
    for(ll i=1;i<=n;i++) is[i]=-1;
    init();
    iiit();
    ll tot=1;
    for(ll i=1;i<=len&&zhi[i]<=2*n;i++)
    {
        if(cnt[zhi[i]]) tot=tot*ksm(zhi[i],cnt[zhi[i]])%p;
    }
    cout<<tot%p;
}