#include <bits/stdc++.h>
using namespace std;
int x, y, ans;
int a[3];
inline void ssort() {
  if (a[0] > a[1]) swap(a[0], a[1]);
  if (a[0] > a[2]) swap(a[0], a[2]);
  if (a[1] > a[2]) swap(a[1], a[2]);
}
inline int solve() {
  a[0] = a[1] = a[2] = y;
  int ans = 0;
  while (!(a[0] == a[1] && a[1] == a[2] && a[0] == x)) {
    ssort();
    a[0] = a[1] + a[2] - 1 > x ? x : a[1] + a[2] - 1;
    ans++;
  }
  return ans;
}
int main() {
  while (~scanf("%d%d", &x, &y)) {
    printf("%d\n", solve());
  }
  return 0;
}
