1 #include<cstdio>
2 #include<iostream>
3 #include<cmath>
4 #include<cstring>
5 #include<algorithm>
6 using namespace std;
7 char ch;
8 bool ok;
9 void read(int &x){
10 ok=0;
11 for (ch=getchar();!isdigit(ch);ch=getchar()) if (ch==‘-‘) ok=1;
12 for (x=0;isdigit(ch);x=x*10+ch-‘0‘,ch=getchar());
13 if (ok) x=-x;
14 }
15 const int maxn=33;
16 int l,r,c[maxn][maxn],cnt[maxn],a[maxn];
17 void init(){
18 for (int i=0;i<=32;i++) c[i][0]=1;
19 for (int i=1;i<=32;i++) for (int j=1;j<=i;j++) c[i][j]=c[i-1][j-1]+c[i-1][j];
20 cnt[0]=1;
21 for (int i=1;i<=32;i++) for (int j=i-1,k=1;j>=k;j--,k++) cnt[i]+=c[i-1][j];
22 for (int i=1;i<=32;i++) cnt[i]+=cnt[i-1];
23 }
24 int calc(int n){
25 int t=n,len=0,ans=0,tmp0=0,tmp1=0;
26 memset(a,0,sizeof(a));
27 while (t) a[++len]=t&1,t>>=1;
28 for (int i=len;i;i--){
29 if (i==len) ans+=cnt[i-1];
30 else if (a[i]){for (int j=i-1;j+tmp0+1>=tmp1+i-1-j;j--) ans+=c[i-1][j];}
31 if (a[i]) tmp1++; else tmp0++;
32 }
33 return ans;
34 }
35 int main(){
36 init();
37 read(l),read(r);
38 printf("%d\n",calc(r+1)-calc(l));
39 return 0;
40 }
