#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0);
const int MOD = 1000000007;
const int HASH = 3137;
void solve() {
  int a, b;
  scanf("%d%d%d", &a, &b);
  int x = b;
  int y = b;
  int z = b;
  int ret = 0;
  while (x < a || y < a || z < a) {
    ret++;
    if (ret % 3 == 1) {
      z = min(a, x + y - 1);
    } else if (ret % 3 == 2) {
      x = min(a, y + z - 1);
    } else {
      y = min(a, z + x - 1);
    }
  }
  printf("%d\n", ret);
}
int main() {
  int qq = 1;
  for (int casenum = 1; casenum <= qq; casenum++) {
    solve();
  }
  return 0;
}
