#include <stdio.h>
#include <stdlib.h>
int put(int n,int p)
{
    if(p==0) return 1;
    if(p==1) return n;
    if(p%2==0) return(put(n*n,p/2));
    if(p%2==1) return(n*put(n*n,p/2));
}
int euler(int n)
{
    int d,e,x,t=1;
    d=2;
    while(d*d<=n)
    {
        e=0;
        while(n%d==0)
            e++,n/=d;
        if(e>0)
        {
            x=put(d,e-1);
            t=t*x*(d-1);
        }
        d++;
    }
    if(n>1)
        t*=(n-1);
    return t;
}
int main()
{
    int a,n;
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%d%d",&a,&n);
    printf("%d\n",put(a,euler(n)-1)%n);

    return 0;
}