Given an integer greater than or equal to $1$ , you are going to play a game where you repeat the “operation”, of which the rules are given below.
The rule below is for one operation.
You will run the operation on the resulting integer repeatedly.
As you can see in the rules, when the integer you have equals $1$ , no operation is performed and the game stops.

 1. If the current integer is $1$ , no operation is performed and the game stops
 2. If the current integer is an odd number other than $1$ , you add $1$ to it.
 3. If the current integer is even, you divide it by $2$ .

For example, if you are initially given $2$, $2→1$ and the game stops after $1$ operation.
If you are initially given $4$ , $4→2→1$ and the game stops after $2$ operations.
If you are initially given $3$ , $3→4→2→1$ and the game stops after $3$ operations.
If you are initially given $6$ , $6→3→4→2→1$ and the game stops after $4$ operations.
As you can see in the previous two examples, if you know the number of operations for $3$ , then you will immediately know the number of operations for $6$ .

You are to write a program that calculates the total number of operations for $N_1,N_1+1,N_1+2,…,N_2$, given $N_1$ and $N_2$ ($1≤N_1≤N_2≤10^6$).


- Time Limit: 1 second for at most $10,000$ test cases. (if you program in Java, then you have 2 seconds).


If your program exceeds the time limit, then it is terminated immediately.  
You can still obtain partial scores (0≤ your score< full score) in that case. If you program in C/C++, use “setbuf(stdout, NULL);” just once before your first call of printf.
If you don’t do this and your program exceeds the time limit, your score is 0 and you cannot obtain partial scores.  
If you program in C++, use "setbuf(stdout, NULL);" as above and use “cout” instead of "printf" to obtain partial scores. 
If you program in Java, use "System.out.printIn".
※ Check the provided sample code for details. 
If you get partial score when your program runs within the time limit, it failed in some test cases.  

- Memory Limit : heap, global, static 256MB, stack 100MB
- Allowed number of submissions: 10 (if two or more have the same score, the one with the fewer number of submissions gets higher rank.)