#include<iostream>

 #include<string>

 #include<algorithm>

 #include<cstdlib>

 #include<cstdio>

 #include<set>

 #include<map>

 #include<vector>

 #include<cstring>

 #include<stack>

 #include<cmath>

 #include<queue>

 #include <bits/stdc++.h>

 using namespace std;

 #define INF 0x3f3f3f3f

 #define ll long long

 #define clc(a,b) memset(a,b,sizeof(a))

 const int maxn=;

 ll n,m;

 ll ans;

 void dfs(ll a,ll b)

 {

     if(a>m)

         return ;

     if(a>=n&&a<=m&&b==)

         ans++;

     if(b==)

         dfs(a*,);

     dfs(a*+,b);

 }

 int main()

 {

     while(~scanf("%I64d%I64d",&n,&m))

     {

         ans=;

         dfs(,);

         printf("%I64d\n",ans);

     }

     return ;

 }