#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int maxn = 1e5 + 20;
priority_queue<int> q;
int main() {
  int x, y;
  scanf("%d%d", &x, &y);
  for (int i = 0; i < 3; i++) q.push(y);
  int ans = 0;
  while (1) {
    int z = q.top();
    q.pop();
    y = q.top();
    q.pop();
    if (z >= x) {
      ans += 2;
      break;
    }
    y = z + y - 1;
    ans++;
    q.push(z);
    q.push(y);
  }
  printf("%d\n", ans);
  return 0;
}
