def isOddNumberPrime(n):
  for x in range(3, n, 2):
    if x * x > n: return True
    if n % x == 0: return False

p4m = [x**4 for x in range(3, 100, 2) if isOddNumberPrime(x)]
ok = []
LIM = 50000000

while True:
  i,x = min(enumerate(p4m), key = lambda x: x[1])
  if x > LIM: break
  ok.append(x)
  p4m[i] *= 2

l = 45000000
r = 50000000
print(sum(1 for x in ok if l <= x <= r))