import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def main():
    mod = 10**9+7
    mod2 = 998244353
    l,r=map(int, input().split())
    hurui=[1]*(10**6+10)
    lr={i:i for i in range(l,r+1)}
    check={i:1 for i in range(l,r+1)}
    for i in range(2,10**6+7):
        if hurui[i]:
            for j in range(i*2,10**6+7,i):
                hurui[j]=0
            for j in range((l//i)*i,r+1,i):
                if l<=j<=r:
                    cnt=0
                    while lr[j]%i==0:
                        cnt+=1
                        lr[j]//=i
                    if cnt>=2:
                        check[j]=0
    def c(x):
        sq=sqrt(x)
        return sq.is_integer() and int(sq)**2==x and x!=1
    print(sum(1 for i in range(l,r+1) if check[i] and not(c(lr[i]))))
    


if __name__ == '__main__':
    main()