// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

#include <sstream>

std::string to_hex_string(int64_t i) {
    std::stringstream s;
    s << std::uppercase << std::hex << i;
    return s.str();
}

std::string FizzBuzz16(int64_t i) {
    if (i % 15 == 0) {
        return "FizzBuzz";
    } else if (i % 3 == 0) {
        return "Fizz";
    } else if (i % 5 == 0) {
        return "Buzz";
    } else {
        return to_hex_string(i);
    }
}

std::string FizzBuzzString16(int64_t n) {
    std::string s = "";
    for (int64_t i = 1; i <= n; i++) {
        s += FizzBuzz16(i);
    }
    return s;
}

ll f(ll x){
    
    V<ll> v;
    rep(i, 13) v.eb((1ll<<(i*4))-1);
    V<ll> w, sw = {0};
    ll xx = 0;
    ll len = 1;
    for(auto x:v) if(x != 0){
        ll res = (x-xx)*len;
        ll fi = x/3 - xx/3;
        ll bu = x/5 - xx/5;
        ll fb = x/15 - xx/15;
        fi -= fb;
        bu -= fb;
        res -= fi*len + bu*len + fb*len;
        res += fi*4 + bu*4 + fb*8;
        w.eb(res);
        sw.eb(sw.back()+res);
        len++;
        xx = x;
    }
    // for(auto x:v) cout << x << " ";
    // cout << endl;
    // for(auto x:w) cout << x << " ";
    // cout << endl;
    // for(auto x:sw) cout << x << " ";
    // cout << endl;
    ll id = UB(x, sw)-1;
    len = id+1;
    // cout << v[id] << " " << id << endl;
    ll L = v[id], R = v[id+1];
    ll llen = sw[id];
    while(L+1!=R){
        ll mid = (L+R)/2;
        
        ll res = sw[id];
        res += (mid-v[id])*len;
        ll fi = mid/3 - v[id]/3;
        ll bu = mid/5 - v[id]/5;
        ll fb = mid/15 - v[id]/15;
        fi -= fb;
        bu -= fb;
        res -= fi*len + bu*len + fb*len;
        res += fi*4 + bu*4 + fb*8;
        if(x >= res) L = mid, llen = res;
        else R = mid;
    }
    string s = FizzBuzz16(R);
    ll res = 0;
    rep(i, x-llen) if(s[i] == 'F' or s[i] == 'B') res++;
    // cout << s << " " << llen << " " << L << " " << R << endl;
    
    
    string t = to_hex_string(R);
    vector dp(2, vector<ll>(15, 0));
    // cout << t << endl;
    auto num = dp;
    num[0][0] = 1;
    for(auto c:t){
        ll x;
        if('0' <= c and c <= '9') x = c-'0';
        else x = c - 'A'+10;
        
        vector ndp(2, vector<ll>(15, 0));
        auto nnum = ndp;
        
        rep(i, 2) rep(j, 15) rep(k, 16){
            if(i==0 and k > x) continue;
            ndp[i or k < x][(j*16+k)%15] += dp[i][j] + num[i][j] * (k==11 or k==15);
            nnum[i or k < x][(j*16+k)%15] += num[i][j];
        }
        swap(ndp, dp);
        swap(nnum, num);
    }
    // cout << res << endl;
    // rep(i, 15) cout << num[1][i] << " ";
    // cout << endl;
    // rep(i, 15) cout << dp[1][i] << " ";
    // cout << endl;
    rep(i, 15){
        if(i%15 == 0) res += num[1][i]*2;
        else if(i%3==0) res += num[1][i];
        else if(i%5==0) res += num[1][i];
        else res += dp[1][i];
    }
    
    
    // cout << res << endl;
    return res;
}





void solve(){
    ll x,y;
    cin >> x >> y;
    x--;
    
    ll ans = f(y)-f(x);
    cout << ans << endl;
    
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}