#include <bits/stdc++.h>
using namespace std;
struct node {
  int x;
  int y;
};
int main() {
  int x[3], y[3];
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    int cnt = 0;
    x[0] = x[1] = x[2] = m;
    while (1) {
      sort(x, x + 3);
      if (x[2] >= n) break;
      x[0] = x[2] + x[1] - 1;
      cnt++;
    }
    printf("%d\n", cnt + 2);
  }
  return 0;
}
