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


ll n,a;

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

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