#include <stdio.h>
#define ll long long
using namespace std;
ll a,n,p,sol=1;

ll prim(ll nr)
{
    ll prime=nr;
    for(ll i=2;i*i<=nr;i++)
        if(nr%i==0)
        {
           while(nr%i==0)nr/=i;
           prime=prime/i*(i-1);
        }
    if(nr!=1)prime=prime/nr*(nr-1);
        return prime;
}

int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%lld%lld",&a,&n);
    p=prim(n)-1;
    while(p)
    {
        if(p&1)
            sol=((sol%n)*(a%n))%n;

        a=((a%n)*(a%n))%n;
        p>>=1;
    }
    printf("%lld",sol);




}