//#include <bits/stdc++.h>

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <map>

 #include <algorithm>

 #include <vector>

 #include <iostream>

 #define pii pair<int,int>

 #define INF 0x7f3f3f3f

 #define LL long long

 #define ULL unsigned long long

 using namespace std;

 const double PI  = acos(-1.0);

 const int N=;

 int f[N][N][N], bit[N];

 //[当前第几位][总位数][1的个数]

 int dfs(int i,int up,int cnt,bool e)

 {

     if(i==)    return cnt*<=up;

     if(!e && ~f[i][up][cnt])    return f[i][up][cnt];

     if(cnt*>up)    return ;

     int ans=;

     int d= i==up?:;

     int u= e? bit[i]: ;

     for( ; d<=u; d++)

     {

         ans+=dfs(i-,up,cnt+d,e&&d==u);

     }

     return e? ans: f[i][up][cnt]=ans;

 }

 int cal(int n)

 {

     if(n<=)    return ;

     int len=;

     while(n)    //拆数

     {

         bit[++len]=(n&);

         n>>=;

     }

     int ans=;

     for(int i=; i<len; i++)    ans+=dfs(i,i,,false);

     ans+=dfs(len,len,,true);

     return ans;

 }

 int main()

 {

     //freopen("input.txt","r",stdin);

     memset(f, -, sizeof(f));

     int a, b;

     scanf("%d%d",&a,&b);

     printf("%d\n",cal(b)-cal(a-) );

     return ;

 }