#include <bits/stdc++.h>
using namespace std;
const int T = 3;
const long long MAX = 1000000001;
long long n, m, k;
int N[T];
int A[T];
int x, y;
void foo() { N[0] = min(x, N[1] + N[2] - 1); }
int main() {
  cin >> x >> y;
  N[0] = N[1] = N[2] = y;
  int ans = 0;
  while (N[0] != x || N[1] != x || N[2] != x) {
    ans++;
    sort(N, N + 3);
    foo();
  }
  cout << ans << endl;
  return 0;
}
