# define _CRT_SECURE_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;
# define INF ((int)(1<<25))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,n) REP(i,n)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<" :"<<x<<endl;
# define EPS 1e-12
template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };

int maxi = 1000000;
int main()
{
	vector<int> a;
	for (int i = 0;; i++)
	{
		int I = pow(2, i);
		if (I > maxi)break;
		for (int j = 0;; j++)
		{
			int J = pow(3, j);
			if (I*J>maxi)break;
			for (int k = 0;; k++)
			{
				int K = pow(5, k);
				a.push_back(I*J*K);
				if (I*J*K > maxi)break;
			}
		}
	}
	sort(ALL(a));
	int m, n;
	while (cin >> m >> n&&(m||n))
	{
		int ans = 0;
		for (auto it = lower_bound(ALL(a), m); *it <= n; it++)ans++;
		cout << ans << endl;
	}
}