/*
written by- Piyush Golani
language- c++
country- India
College- N.I.T Jamshedpur
*/
#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<map>
#include<queue>
#include<cctype>
using namespace std;
#define pb push_back
#define all(s) s.begin(),s.end()
#define f(i,a,b) for(int i=a;i<b;i++)
#define F(i,a,b) for(int i=a;i>=b;i--)
#define PI 3.1415926535897932384626433832795
#define INF 2000000000
#define BIG_INF 7000000000000000000LL
#define mp make_pair
#define eps 1e-9
#define LL long long
#define si(n) scanf("%d",&n)
#define sll(n) scanf("%lld",&n)
#define mod 1000000007
#define mm 10000000

string inttostring(int n)
{
    stringstream a;
    a<<n;
    return a.str();
}

int stringtoint(string A)
{
    istringstream a(A);
    int p;
    a>>p;
    return p;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

class TheDivisionGame {
public:
   long long countWinningIntervals( int L, int R ) {
    int n=R-L+1;
    int cur[n],nim[n];
    memset(nim,0,sizeof(nim));
    f(i,L,R+1)
    {
        cur[i-L]=i;
    }
    for(int i=2;i*i<=R;i++)
    {
        int s=L;
        if(L%i!=0)
        s+=i-(s%i);
        while(s<=R)
        {
            while(cur[s-L]%i==0)
            {
                cur[s-L]/=i;
                nim[s-L]++;
            }
            s+=i;
        }
    }
    f(i,0,n)
    {
        if(cur[i]>1) nim[i]++;
    }
    LL dp[32][2]={0},res=0;
    for(int i=n-1;i>=0;i--)
    {
        f(x,0,32)
        {
            dp[x^nim[i]][i%2]=dp[x][!(i%2)];
        }
        dp[nim[i]][i%2]++;
        res+=dp[0][i%2];
    }
    return ((LL)n*(n+1))/2-res;
   }
};

// BEGIN CUT HERE
namespace moj_harness {
    int run_test_case(int);
	void run_test(int casenum = -1, bool quiet = false) {
		if (casenum != -1) {
			if (run_test_case(casenum) == -1 && !quiet) {
				cerr << "Illegal input! Test case " << casenum << " does not exist." << endl;
			}
			return;
		}

		int correct = 0, total = 0;
		for (int i=0;; ++i) {
			int x = run_test_case(i);
			if (x == -1) {
				if (i >= 100) break;
				continue;
			}
			correct += x;
			++total;
		}

		if (total == 0) {
			cerr << "No test cases run." << endl;
		} else if (correct < total) {
			cerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl;
		} else {
			cerr << "All " << total << " tests passed!" << endl;
		}
	}

	int verify_case(int casenum, const long long &expected, const long long &received, clock_t elapsed) {
		cerr << "Example " << casenum << "... ";

		string verdict;
		vector<string> info;
		char buf[100];

		if (elapsed > CLOCKS_PER_SEC / 200) {
			sprintf(buf, "time %.2fs", elapsed * (1.0/CLOCKS_PER_SEC));
			info.push_back(buf);
		}

		if (expected == received) {
			verdict = "PASSED";
		} else {
			verdict = "FAILED";
		}

		cerr << verdict;
		if (!info.empty()) {
			cerr << " (";
			for (int i=0; i<(int)info.size(); ++i) {
				if (i > 0) cerr << ", ";
				cerr << info[i];
			}
			cerr << ")";
		}
		cerr << endl;

		if (verdict == "FAILED") {
			cerr << "    Expected: " << expected << endl;
			cerr << "    Received: " << received << endl;
		}

		return verdict == "PASSED";
	}

	int run_test_case(int casenum__) {
		switch (casenum__) {
		case 0: {
			int L                     = 9;
			int R                     = 10;
			long long expected__      = 2;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 1: {
			int L                     = 2;
			int R                     = 5;
			long long expected__      = 9;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 2: {
			int L                     = 2;
			int R                     = 6;
			long long expected__      = 13;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 3: {
			int L                     = 2;
			int R                     = 100;
			long long expected__      = 4345;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}
		case 4: {
			int L                     = 12566125;
			int R                     = 12567777;
			long long expected__      = 1313432;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}

		// custom cases

/*      case 5: {
			int L                     = ;
			int R                     = ;
			long long expected__      = ;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
/*      case 6: {
			int L                     = ;
			int R                     = ;
			long long expected__      = ;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
/*      case 7: {
			int L                     = ;
			int R                     = ;
			long long expected__      = ;

			clock_t start__           = clock();
			long long received__      = TheDivisionGame().countWinningIntervals(L, R);
			return verify_case(casenum__, expected__, received__, clock()-start__);
		}*/
		default:
			return -1;
		}
	}
}


int main(int argc, char *argv[]) {
	if (argc == 1) {
		moj_harness::run_test();
	} else {
		for (int i=1; i<argc; ++i)
			moj_harness::run_test(atoi(argv[i]));
	}
}
// END CUT HERE