#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iostream>
#include <functional>
#include <time.h>
#include <cmath>
#include <deque>

using namespace std;

#define ll long long
#define mp make_pair
#define pb push_back
#define ld long double
#pragma comment(linker, "/STACK:36777216")



ll EPS = 1000000007;
double PI = 3.14159265358979323846;
const int MAXN = 1000010;


ll abss(ll h)
{
  if (h < 0)
  {
    return -h;
  }
  return h;
}

__int64 ceill(__int64 x, __int64 y)
{
  if (x % y != 0)
  {
    return (x / y) + 1;
  }
  return x / y;
}


int n, m, k;

ll a[MAXN * 10];
ll b[MAXN];


const int c[100] = {2, 3, 4, 6, 8, 10, 16, 18, 20, 28, 32, 64, 104, 128, 136, 256, 464, 496, 512,
 650, 1024, 1952, 2048, 4096, 8128, 8192, 16384, 32768, 32896, 65536, 130304, 131072, 262144, 522752, 524288};

char q[100];

int main()
{
	// freopen("strings1.txt", "r", stdin);
	//freopen("strings.txt", "w", stdout);
	int l, r;
	cin >> l >> r;
	int count = 0;
	for (int i = 0; i <= 37; i++)
	{
		if (c[i] >= l && c[i] <= r)
		{
			count++;
		}
	}
	cout << count;
}