#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cctype>

#include<cstdlib>

#include<vector>

#include<map>

#include<set>

#define ll long long

#define R register ll

static char B[<<],*S=B,*D=B;

#define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

using namespace std;

inline ll g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

} ll q[],l,r,ans; bool vis[]; int tot;

inline void PRE(ll x) {if(x>r) return ; if(x) q[++tot]=x; PRE(x*+); PRE(x*+);}

inline ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}

inline bool cmp(const ll& a,const ll& b) {return a>b;}

inline void dfs(int x,int d,ll L) {

    if(x==tot) return ; ++x; dfs(x,d,L); d^=;

    if(vis[x]) return ; L=L*q[x]/gcd(L,q[x]);

    if(L<=||L>r) return ; if(d) ans+=r/L-(l-)/L;

    else ans-=r/L-(l-)/L; dfs(x,d,L);

}

signed main() {

    l=g(),r=g(); PRE(); sort(q+,q+tot+,cmp);

    for(R i=;i<=tot;++i) for(R j=i+;j<=tot;++j) if(q[i]%q[j]==) {vis[i]=; break; }

    dfs(,,); printf("%lld\n",ans);

}