#include <iostream>
#include <cstdio>
using namespace std;
int mod;
long long logpow(long long base, long long p)
{
    int b=32;
    long long A=1;
    while(b>=0)
    {
        if(p&1LL<<b)
        {
            A=(A*A)%mod;
            A=(A*base)%mod;
        }
        else
        {
            A=(A*A)%mod;
        }
        b--;
    }
    return A;
}
int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    int a,n;
    cin>>a>>n;
    mod=n;
    cout<<logpow(a,n-2)%n;
    return 0;
}