#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1; i>=0; i--)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int main() {
  int M=1000001;
  bool d[M];
  memset(d,false,sizeof(d));
  d[1]=true;
  rep(i,M) {
    if(d[i]) {
      if(i*2<M) d[i*2]=true;
      if(i*3<M) d[i*3]=true;
      if(i*5<M) d[i*5]=true;
    }
  }
  int n,m;
  while(cin >> n && n) {
    cin >> m;
    int ans=0;
    REP(i,n,m+1) ans+=d[i];
    pr(ans);
  }
  return 0;
}
