zoj Treasure Hunt IV

treasure hunt iv

time limit: 2 seconds

     memory

limit: 65536 kb

alice is exploring the wonderland, suddenly she fell into a hole, when she

woke up, she found there are b - a + 1 treasures

labled a from b in front of her.

alice

was very excited but unfortunately not all of the treasures are real, some are

fake.

now we know a treasure labled n is real if and only

if [n/1] + [n/2] + ... + [n/k] + ... is even.

now

given 2 integers a and b, your job is to

calculate how many real treasures are there.

the input contains multiple cases, each case contains two

integers a and b (0

<= a <= b <= 263-1)

seperated by a single space. proceed to the end of file.

output the total number of real treasure.