#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
map<ll,ll> mp; 
ll x, y;


ll dfs(ll n) {
  if(n == x) return 0;
  else if(n < x) return x - n;
  else if(mp[n] != 0) return mp[n];
  ll res = n - x;
  ll mod[1] = {n % 2};
  ll div[1] = {2};
  ll nex;
  rep(i,1) {
    nex = (n - mod[i])/div[i];
    res = min(res,dfs(nex)+1+mod[i]);
    nex++;
    if(mod[i] != 0) res = min(res,dfs(nex)+1+(div[i]-mod[i]));
  }
  return mp[n] = res;
}

int main(){
  cin >> x >> y;
  if(x >= y) {
    cout << x-y << endl;
    return 0;
  }
  cout << dfs(y) << endl;
  return 0;
}

#ifdef ONLINE_JUDGE
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#else
#define _GLIBCXX_DEBUG
#endif

#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <cmath>
#include <functional>
#include <set>
#include <numeric>
#include <bitset>
#include <cassert>

using std::cerr;
using std::cin;
using std::cout;
using std::pair;
using std::string;
using std::vector;
//region
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b); i >= (b); --i)
#define rep(i, n) for (unsigned i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n)-1; i >= 0; --i)
#define repr1(i, n) for (int i = (n); i > 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define mset(v, n) std::memset((v), n, sizeof(v))
#define BIT(n) (1LL << (n))
#define each(i, v) for (auto&& i : (v))
#define unless(f) if(!(f))
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using vint = vector<int>;
using vlong = vector<ll>;
using vstr = vector<string>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpll = vector<pll>;
using vvi = vector<vint>;
using vvl = vector<vlong>;
template<typename T> using VV = vector<vector<T>>;

vector<string> split(const string &s, const string &delim) {
  vector<string> res;
  uint pos = 0;
  while (true) {
    const size_t found = s.find(delim, pos);
    if (found < 0) {
      res.push_back(s.substr(pos));
      break;
    }
    res.push_back(s.substr(pos, found - pos));
    pos = found + delim.size();
  }
  return res;
}

template<typename T>
string join(vector<T> &vec, const string &sep) {
  size_t size = vec.size();
  if (!size) return "";
  std::stringstream ss;
  for (int i = 0; i < size - 1; i++)
    ss << vec[i] << sep;
  ss << vec[size - 1];
  return ss.str();
}

template<typename T>
std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}

template<typename Iter>
inline void print(const Iter &first, const Iter &last, const std::string &d = " ", bool endline = true) {
  cout << *first;
  for (Iter iter = first + 1; iter < last; ++iter) {
    cout << d << *iter;
  }
  if (endline) cout << "\n";
}

constexpr ll powmod(ll a, ull b, uint p) {
  ll res = 1;
  while (b > 0) {
    if (b % 2) res = res * a % p;
    a = a * a % p;
    b >>= 1u;
  }
  return res;
}

constexpr ll pow(ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b % 2) res = res * a;
    a = a * a;
    b >>= 1u;
  }
  return res;
}

template<class T>
bool chmax(T &a, const T &b) { return a < b && (a = b, true); }

template<class T>
bool chmin(T &a, const T &b) { return a > b && (a = b, true); }

template<typename T>
void bsort(vector<T> &v) { std::sort(v.begin(), v.end()); }

template<typename T>
void rsort(vector<T> &v) { std::sort(v.begin(), v.end(), std::greater<T>()); }

struct iii {
    iii() {
      cin.tie(nullptr);
      cout.tie(nullptr);
      std::ios::sync_with_stdio(false);
      cout << std::fixed << std::setprecision(16);
    }
} init;
//endregion

void solve();

int main() {
  int t = 1;
  // scanf("%d", &t);
  // cin >> t;
  rep(i, t) solve();
  return 0;
}

ll X, Y;
std::map<ll, ll> memo;

ll calc(ll n) {
  if (memo[n]) return memo[n];
  if (n <= X) return X - n;
  if (n - X == 1) return 1;

  ll res = n - X;

  ll l = n / 2 * 2, r = (n + 1) / 2 * 2;

  chmin(res, std::abs(l - n) + calc(l / 2) + 1);
  chmin(res, std::abs(r - n) + calc(r / 2) + 1);

  return memo[n] = res;
}

void solve() {
  cin >> X >> Y;
  cout << calc(Y) << std::endl;
}
