#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;

ll gcd(ll a, ll b) {
	while (b != 0) {
		a = a % b;
		swap(a, b);
	}
	return a;
}

int main()
{
	ll N, D,ans;
	cin >> N >> D;

	if (N == D)
		ans = 0;
	else if (N % D == 0)
		ans = N / D - 1;
	else
		ans = (N*D /gcd(N, D))/D -1;

	cout << ans << endl;
	return	0;
}