#include <bits/stdc++.h>
using namespace std;
int n, k, a, b, c, ans;
int main() {
  int i, t;
  scanf("%d%d", &n, &k), a = b = c = k;
  while (1) {
    if (a > b) swap(a, b);
    if (a > c) swap(a, c);
    t = max(a + b, b + c), t = max(t, a + c);
    if (t > n) break;
    a = b + c - 1, ans++;
  }
  return printf("%d", ans + 3), 0;
}
