cf B. Code For 1

B. Code For 1

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon's place as maester of Castle Black. Jon agrees to Sam's proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility.

Initially Sam has a list with a single element n. Then he has to perform certain operations on this list. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , ,  sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.

Now the masters want the total number of 1s in the range l to r (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?

Input

The first line contains three integers n, l, r (0 ≤ n < 250, 0 ≤ r - l ≤ 105, r ≥ 1, l ≥ 1) – initial element and the range l to r.

It is guaranteed that r is not greater than the length of the final list.

Output

Output the total number of 1s in the range l to r in the final sequence.

Examples

input

7 2 5

output

4

input

10 3 10

output

5

Note

Consider first example:

Elements on positions from 2-nd to 5-th in list is [1, 1, 1, 1]. The number of ones is 4.

For the second example:

Elements on positions from 3-rd to 10-th in list is [1, 1, 1, 0, 1, 0, 1, 0]. The number of ones is 5.

思路：把对称轴求出来即 把以2的n次方放到一个数组里面   ，其次发现奇数位永远为奇数，其实利用对称性把区间内的其他偶数位求出来就行

#include <bits/stdc++.h>
using namespace std;
long long n, l, r;
long long a[11100];
void init(long long n)
{
    int num = log2(n);

    long long num_ = (long long)pow(2, num);
    //printf("%d\n",num_);
    //num++;
    while(num_ > 0)
    {
        a[num] = n % 2;//printf("num: %d  %d----\n",num,a[num]);
        num--;
        n /= 2;
        num_/= 2;
    }
    //a[0] = 1;
}
long long Find(long long id)
{
    if(id % 2) return 0;
    long long p = 2;
    while(id % p == 0)
    {
        if( id == p) return log2(p);
        p <<= 1;
    }
    return log2(p >> 1);
}
int main()
{
   while(~scanf("%lld%lld%lld", &n, &l, &r))
   {
       init(n);
       long long sum = 0;
       for( long long i = l; i <= r; i++)
       {
           //printf("i find %lld %lld\n",i,Find(i));
          sum +=  a[Find(i)];
       }
       printf("%d\n",sum);
   }
}