#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int i,j,length,n,arr[100005],p,l,m,k;
while(scanf("%d %d",&i,&j)==2)
{
if(i==0 && j==0)
break;
p=0;
for(k=i;k<=j;k++)
{
length=0;
n=k;
while(n!=0)
{
if(n==1)
{
length++;
break;
}
if(n%2==1)
n=3*n+1;
else
n/=2;
length++;
}
arr[p]=length;
p++;
}
l=j-i;
m=* max_element( arr, arr + l );
printf("%d\n",m);
}
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdGRpbz4KI2luY2x1ZGU8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpCnsKICAgIGludCBpLGosbGVuZ3RoLG4sYXJyWzEwMDAwNV0scCxsLG0sazsKICAgIHdoaWxlKHNjYW5mKCIlZCAlZCIsJmksJmopPT0yKQogICB7CiAgICAgICAgaWYoaT09MCAmJiBqPT0wKQogICAgICAgICAgICBicmVhazsKICAgICAgICBwPTA7CiAgICAgICAgZm9yKGs9aTtrPD1qO2srKykKICAgICAgICB7CiAgICAgICAgICAgIGxlbmd0aD0wOwogICAgICAgICAgICBuPWs7CiAgICAgICAgICAgIHdoaWxlKG4hPTApCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGlmKG49PTEpCiAgICAgICAgICAgICAgICB7CiAgICAgICAgICAgICAgICAgICAgbGVuZ3RoKys7CiAgICAgICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgICBpZihuJTI9PTEpCiAgICAgICAgICAgICAgICAgICAgbj0zKm4rMTsKICAgICAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgICAgICBuLz0yOwoKICAgICAgICAgICAgICAgIGxlbmd0aCsrOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGFycltwXT1sZW5ndGg7CiAgICAgICAgICAgIHArKzsKICAgICAgICB9CiAgICAgICAgbD1qLWk7CiAgICAgICAgbT0qIG1heF9lbGVtZW50KCBhcnIsIGFyciArIGwgKTsKICAgICAgICBwcmludGYoIiVkXG4iLG0pOwogICB9CnJldHVybiAwOwp9Cg==