#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> edge(3);
  int target(0), curr(0);
  while (cin >> target >> curr) {
    fill(edge.begin(), edge.end(), curr);
    int res(0);
    while (true) {
      bool flag = true;
      for (int i = 0; i < 3; ++i) {
        if (edge[i] != target) {
          flag = false;
        }
      }
      if (flag) {
        break;
      }
      sort(edge.begin(), edge.end());
      if (edge[1] + edge[2] - 1 < target) {
        edge[0] = edge[1] + edge[2] - 1;
      } else {
        edge[0] = target;
      }
      ++res;
    }
    cout << res << endl;
  }
  return 0;
}
