#include<iostream>
using namespace std;
long gcd(long a,long b){return b?gcd(b,a%b):a;}
long P,Q;
int main()
{
	cin>>P>>Q;
	long Lq=0,Lp=1,Rq=1,Rp=0;
	for(int a=1;a<P;a++)
	{
		{
			long b=(Q*a+P-1)/P-1;
			while(gcd(a,b)>1)b--;
			if(Lq*a<b*Lp)Lq=b,Lp=a;
		}
		{
			long b=Q*a/P+1;
			while(gcd(a,b)>1)b++;
			if(Rq*a>b*Rp)Rq=b,Rp=a;
		}
	}
	cout<<Lq+Lp+Rq+Rp<<endl;
}