#include <cstdio>
#include <cmath>

using namespace std;

int a,n;

int rid_putere(int a,int f)
{
    int s=1;
    for(long long i=1;i<=f;i<<=1)
    {
        if(f&i) s=(1LL*s*a)%n;
        a=(1LL*a*a)%n;
    }
    return s;
}

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