#include <bits/stdc++.h>
using namespace std;
const long long maxn = 200005;
const long long MOD = 1e9 + 7;
void solve() {
  long long x, y;
  cin >> x >> y;
  long long a[3];
  a[0] = a[1] = a[2] = y;
  long long tm = 0;
  while (1) {
    a[0] = min(x, a[1] + a[2] - 1);
    tm++;
    sort(a, a + 3);
    if (a[0] == x) {
      break;
    }
  }
  cout << tm;
}
int32_t main() {
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
