/*
It always seems impossible until its done.
**/
#include <bits/stdc++.h>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
inline long long Log_Put(long long x,long long n,long long MOD)
{
    long long p=1;
    while(n>0)
    {
        if(n&1)
        {
            p=(1LL*p*x)%MOD;
            n--;
        }
        x=(1LL*x*x)%MOD;
        n/=2;
    }
    return p;
}

int main()
{
    int x,n;
    f>>x>>n;
    g<<Log_Put(x,n-2,n)<<"\n";
    return 0;
}