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

const int MAX = 2e8+500;

void solve() {
    bitset<MAX> s;
    vector<int> pr;
    int d = 1;
    int x, goal; cin >> x >> goal;
    s[x] = 1;
    s[0] = 1;
    pr.push_back(x);
    if (x == goal) {
        cout << 1 << endl;
        return;
    }
    for (int i = 2; ; ++i) {
        while (s[d]) d++; 
        x += d;
        s[x] = 1;
        for (auto y : pr) s[x-y] = 1;
        pr.push_back(x);       
        // cerr << x << endl;
        if (s[goal]) {
            cout << i << endl;
            return;
        }
    }
}

int main() {
    cin.tie(0);
    cin.sync_with_stdio(0);

	int t = 1;
    // cin >> t;
	while (t--) solve();
}