#include <cstdio>
using namespace std;
long long pow(int n,int p)
{
    int i,k=1;
    for(i=1;i<=p;i++)
        k=k*n;
    return k;
}
int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    int n,a;
    scanf("%d%d",&a,&n);
    int k;k=(pow(a,n-2))%n;
    printf("%d",k);
    return 0;
}