#include <stdio.h>
int n,x,y,a;
int euclid(int a,int b,int &x,int &y)
{
    if (b==0)
    {
        y=0;
        x=1;
        return a;
    }
    int x0,y0,d;
    d=euclid(b,a%b,x0,y0);
    x=y0;
    y=x0-(a/b)*y0;
    return d;
}
int main(void)
{
    int d;
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%d%d",&a,&n);
    d=euclid(a,n,x,y);
    while (x<0) x+=n;
    printf("%d\n",x);
    return 0;
}