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