#include<algorithm> #include<iostream> #include<cstdio> #include<cmath> #define ll long long #define N 10001 using namespace std; ll l,r,ans,a[N],b[N]; int t,n,m; bool vis[N]; inline ll gcd(ll x,ll y){return y==0?x:gcd(y,x%y);} void pre(int x,ll y){ if(y>r)return; if(x>0)a[++m]=y; pre(x+1,y*10+6); pre(x+1,y*10+8); } void dfs(int x,int y,ll z){ if(x>n){ if(y&1)ans+=r/z-(l-1)/z; else if(y)ans-=r/z-(l-1)/z; return; } dfs(x+1,y,z); ll next=z/gcd(a[x],z); if((double)a[x]*next<=r)dfs(x+1,y+1,a[x]*next); } int main(){ //scanf("%lld%lld",&l,&r); cin>>l>>r; pre(0,0); sort(a+1,a+m+1); for(int i=1;i<=m;i++) if(!vis[i]){ b[++n]=a[i]; for(int j=i+1;j<=m;j++) if(!(a[j]%a[i]))vis[j]=1; } for(int i=1;i<=n;i++) a[n-i+1]=b[i]; dfs(1,0,1); cout<<ans; return 0; }