How many Fibs?

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner cin = new Scanner(System.in);
while(cin.hasNext()){
int cnt = 0;
BigInteger l = cin.nextBigInteger();
BigInteger r = cin.nextBigInteger();
int t1 = l.compareTo(BigInteger.ZERO);
int t2 = r.compareTo(BigInteger.ZERO);
if (t1==0&&t2==0)
break;
BigInteger f1 = BigInteger.valueOf(1);
BigInteger f2 = BigInteger.valueOf(2);
int s1 = l.compareTo(f1);
int s2 = r.compareTo(f1);
if(s1<=0&&s2>=0)
cnt++;
s1 = l.compareTo(f2);
s2 = r.compareTo(f2);
if(s1<=0&&s2>=0)
cnt++;
while(true)
{
BigInteger f = f1.add(f2);
s1 = l.compareTo(f);
s2 = r.compareTo(f);
if(s1<=0&&s2>=0)
cnt++;
if (s2 < 0)
break;
f1 = f2;
f2 = f;
}
System.out.println(cnt);

}
}

}