#include<cstdio>

#include<cstdlib>

#include<cctype>

#include<algorithm>

#include<cstring>

#define maxn 200020

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

long long q[maxn];int tot;

long long d[maxn];int cnt;

bool vis[maxn];

void find(int deep,long long now){

    if(deep==){

        q[++tot]=now;

        return;

    }

    find(deep-,now*+);

    find(deep-,now*+);

}

bool cmp(long long a,long long b){    return a>b;    }

long long calc(long long l,long long r,long long e){

    if(l%e==)    l/=e;

    else l=l/e+;

    r/=e;

    return r-l+;

}

long long gcd(long long a,long long b){

    return b==?a:gcd(b,a%b);

}

long long ans=;

long long a,b;

void dfs(int deep,int Cnt,long long val){

    if(val>b)    return;

    if(deep>cnt){

        if(Cnt==)    return;

        ans+=calc(a,b,val)*(Cnt&?:-);

        return;

    }

    dfs(deep+,Cnt,val);

    long long tmp=val/gcd(val,d[deep]);

    if(1.0*tmp*d[deep]<=b)    dfs(deep+,Cnt+,tmp*d[deep]);

}

int main(){

    a=read(),b=read();

    for(int i=;i<=;++i)    find(i,);

    for(int i=;i<=tot;++i){

        if(vis[i]==)    d[++cnt]=q[i];

        for(int j=i+;j<=tot;++j)

            if(q[j]%q[i]==)    vis[j]=;

    }

    sort(d+,d+cnt+,cmp);

    dfs(,,);

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

    return ;

}