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