#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

ll N, D;


int main(){
	cin >> N >> D;
	
	ll ans = 0;
	set<ll>used;
	ll pre = 1;
	used.insert(pre);
	while (1) {
		ll c = (N - pre) / D;
		ans += c;
		ll nextst = (pre + (c + 1)*D - N) % D;
		if (used.count(nextst) == 0) {
			pre = nextst;
			used.insert(pre);
		}
		else break;
	}

	cout << ans << endl;

	return 0;
}