#include <iostream>

#include <cstdio>

#include <algorithm>

#include <string>

#include <cstring>

using namespace std;

typedef long long ll;

ll len=;

int dfs(ll n,ll L,ll R,ll l,ll r)

    {

        if(L>r||R<l||n==)return ;

        if(n==)return ;

        ll mid  = L + (R-L)/;

        return dfs(n/,L,mid-,l,r)+dfs(n%,mid,mid,l,r)+dfs(n/,mid+,R,l,r);

    }

int main(){

    ll n,l,r;

    scanf("%lld%lld%lld",&n,&l,&r);

    ll N = n;

    while(N>)

    {

        len=len*+;

        N/=;

    }

    printf("%d\n",dfs(n,,len,l,r));

    return ;

}