Ramu is a big fan of hollywood movies. His hostel mates flock to him to ask his reviews for the movies. Owing to his straight forward nature, he rates them as "Watch" (1) or "Don't Watch" (0) type.

One day he listed all the movies he has watched and found a string of 0s and 1s.

The string goes as follows:

    01001110000011111111...

The string is 0-based-indexed.

His friend who resides in Hollywood challenged him to get the number of ones which lies between index L and R (both inclusive). If he solves the problem, the friend will accompany him to his favorite place hollywood, a place in California.

Your Input : 7 376

NOTE You do not need to create a program for this problem you have to write your answers of given input in given code snippet

• To see how to submit solution please check this link

Compile and Test can give Wrong Answer. Once you have written your answer, press Submit button to check your result.