#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	int m, n;
	cin >> m >> n;
	int numerator = m;
	int denominator = n;
	int count = 0;
	while (numerator != denominator) {
		if (numerator < denominator) {
			swap(numerator, denominator);
			++count;
		} else {
			int repeat = (numerator - 1) / denominator;
			numerator -= repeat * denominator;
			count += repeat;
		}
	}
	cout << count << endl;
	return 0;
}