#include<cstdio>
#include<iostream>
#define ll long long
using namespace std;

ll n,a;

ll getphi(ll numar)
{
    int nr=numar,sol=numar;
    for(int i=2;i*i<=numar;i++)
        if(nr%i==0)
        {
            while(nr%i==0) nr/=i;
            sol=(sol/i)*(i-1);
        }
    if(nr>1)
    {
        sol=(sol/nr)*(nr-1);
    }
    return sol;
}

int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%lld%lld",&a,&n);
    ll p=getphi(n)-1;
    ll sol=1;
    for(ll i=1; i<=p; i<<=1)
    {
        if( i&p ) sol=sol*a%n;
        a=a*a%n;
    }
    cout<<sol<<'\n';
    return 0;
}