L,R = map(int, input().split())
count = 0

def is_prime(n):
    if n == 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

for i in range(L-1,R):
    s = i+1
    for j in range(i,R):
        for k in range(i+1,j+1):
            s += (k+1)
        if is_prime(s) == True:
            count += 1

print(count)