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