#include <cstdio>
using namespace std;
long long p(long long a,int put,int mod)
{
    long long pow=1;
    while(put)
    {
        if(put%2)
        {
            put--;
            pow*=a;
            pow%=mod;
        }
        a*=a;
        a%=mod;
        put/=2;
    }
    return pow;
}
int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    int n,i,put,cn,a;
    long long k;
    scanf("%d%d",&a,&n);
    put=n-1;
    cn=n;
    for(i=2;i*i<=n;i++)
        if(n%i==0)
        {
            put-=(put/i);
            while(n%i==0)
                n/=i;
        }
    if(n>1&&cn>n)
        put-=(put/n);
    n=cn;
    put--;
    k=a;
    printf("%lld",p(k,put,n));
    return 0;
}