#include <cstdio>

using namespace std;

long long PowLog(long long N, long long P, long long MOD)
{
    long long Sol = 1;

    while(P)
    {
        if(P&1)
            Sol = (Sol * N)%MOD;
        N = (N * N) % MOD;
        P >>= 1;
    }
    return Sol;
}

int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);

    int N,A;
    scanf("%d %d",&A,&N);
    printf("%lld",PowLog(A,N-2,N));

    return 0;
}