#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll P,Q;

pair<ll,ll> hoge(ll p,ll q) {
	ll a=0,b=1;
	ll v=0;
	for(ll i=2;i<q;i++) {
		while((v+1)*q<i*p) v++;
		int d=__gcd(v,i)>1;
		v-=d;
		
		if(a*i<v*b) a=v,b=i;
		
		v+=d;
		
	}
	return {a,b};
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>P>>Q;
	
	ll v=P/Q;
	P%=Q;
	pair<ll,ll> L=hoge(P,Q);
	pair<ll,ll> R=hoge(Q-P,Q);
	R.first=R.second-R.first;
	L.first+=v*L.second;
	R.first+=v*R.second;
	
	cout<<L.first+L.second+R.first+R.second<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}