#include <cstdio>

using namespace std;
int n,m,a,i,mod;
int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%d%d",&a,&n);
    m=1;mod=n;
    for(i=2;i*i<=n;i++)
        if(n%i==0)
        {
            m*=i-1;n/=i;
            while(n%i==0)
            {
                m*=i;n/=i;
            }
        }
    if(n>1)m*=n-1;
    m--;i=1;
    for(;m;m>>=1)
    {
        if(m&1)i=1LL*i*a%mod; //m&1==m%2
        a=1LL*a*a%mod;
    }
    printf("%d\n",i);
    return 0;
}