#include <bits/stdc++.h>
using namespace std;
#define int long long

map<pair<int, int>, int>mp;
vector<int>cnt;
int dfs(int a, int t) {
    if(a == 1) return 0;
    if(t == 1) return a - 1;
    if(mp[{a, t}]) return mp[{a, t}];
    int res = a - 1;
    for(auto i : cnt) {
        if(t % i == 0) {
            int tmp = dfs(a / i, t / i) + a % i + 1;
            int tmp2 = dfs(a / i + 1, t / i ) + i - (a % i) + 1;
            res = min({tmp, tmp2, res});
        }
    }
    mp[{a, t}] = res;
    return res;
}

void solve() {
	int a, b;
	cin >> a >> b;
	if (a > b) {
		swap(a, b);
	}
	int t = b - a;
	for (int i = 2; i <= t; i++) {
		if (t % i == 0) {
			cnt.push_back(i);
			while (t % i == 0) {
				t /= i;
			}
		}
	}
	if (t != 1) {
		cnt.push_back(t);
	}
	cout << dfs(a, b - a) << endl;
	return;
}




signed main() {
	ios::sync_with_stdio(false);
	int tt = 1;
	// cin >> tt;
	while (tt--) {
		solve();
	}
}