http://acm.hust.edu.cn/vjudge/contest/view.action?cid=30506#problem/P
import java.util.*;
import java.math.*;
public class Main {
public static void main(String args[])
{
Scanner cin=new Scanner(System.in);
BigInteger f[]=new BigInteger[1000];
BigInteger a,b;
int i,ans;
f[1]=BigInteger.ONE;
f[2]=BigInteger.valueOf(2);
for(i=3;i<1000;i++)
f[i]=f[i-1].add(f[i-2]);
while(true)
{
a=cin.nextBigInteger();
b=cin.nextBigInteger();
if(a.compareTo(b)>0)
{
System.out.println(0);
continue;
}
if(a.compareTo(BigInteger.ZERO)==0&&b.compareTo(BigInteger.ZERO)==0)
break;
ans=0;
for(i=1;i<1000;i++)
{
if(f[i].compareTo(a)>=0&&f[i].compareTo(b)<=0)
ans=ans+1;
}
System.out.println(ans);
}
}
}