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