#include <stdio.h>
#include <stdlib.h>
long long put(long long n,long long p,long long x)
{
    if(p==0) return 1;
    if(p==1) return n;
    if(p%2==0) return(put(n*n%x,p/2,x))%x;
    if(p%2==1) return(n*put(n*n%x,p/2,x))%x;
}
long long euler(long long n,long long y)
{
    long long d,e,x,t=1;
    d=2;
    while(d*d<=n)
    {
        e=0;
        while(n%d==0)
            e++,n/=d;
        if(e>0)
        {
            x=put(d,e-1,y);
            t=(t*x%y)*(d-1)%y;
        }
        d++;
    }
    if(n>1)
        t*=(n-1)%y;
    return t%y;
}
int main()
{
    long long  a,n;
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%lld%lld",&a,&n);
    printf("%lld\n",put(a,euler(n,n)-1,n)%n);

    return 0;
}