#include <cstdio>
#include <cmath>

using namespace std;

int n;

int rid_put(int a,int b)
{
    int sol=1;
    for(long long i=1;i<=b;i<<=1)
    {
        if(b&i) sol=(1LL*sol*a)%n;
        a=(1LL*a*a)%n;
    }
    return sol;
}

int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    int a;
    scanf("%d%d",&a,&n);
    int lim=sqrt(n);
    int nr=n,fi=n;
    for(int i=2;i<=lim;i++)
        if(nr%i==0)
        {
            while(nr%i==0) nr/=i;
            fi=(fi*(i-1))/i;
        }
    if(nr>1) fi=(fi*(nr-1))/nr;
    printf("%d",rid_put(a,fi-1));
    return 0;
}