import math

primes = [True]*(10**5+1)

primes[0],primes[1] = False,False

cumsum = [0]*(10**5+1)



for i in range(2, int(math.sqrt(10**5)+1)):

  if primes[i]:

    j = 2

    while i*j <= 10**5:

      primes[i*j] = False

      j += 1



for i in range(2, 10**5+1):

  if primes[i] and primes[(i+1)//2]:

    cumsum[i] = cumsum[i-1]+1

  else:

    cumsum[i] = cumsum[i-1]



Q = int(eval(input()))

for _ in range(Q):

  l,r = list(map(int,input().split()))

  print((cumsum[r]-cumsum[l-1]))
MAX_INT = 10**5+1

primes = [True] * (10**5+1)

primes[0], primes[1] = False, False

for i in range(2, int(MAX_INT**0.5)+1):

  if primes[i]:

    for j in range(i*2, MAX_INT, i):

      primes[j] = False



cumsum = [0] * (10**5+1)

for i in range(1, 10**5+1, 2):

  if primes[i] and primes[(i+1)//2]:

      cumsum[i] = 1



for i in range(1, 10**5+1):

  cumsum[i] += cumsum[i-1]



Q = int(eval(input()))

for _ in range(Q):

  l,r = list(map(int,input().split()))

  print((cumsum[r]-cumsum[l-1]))
import math

primes = [True] * (10**5 + 1)
primes[0], primes[1] = False, False
cumsum = [0] * (10**5 + 1)
for i in range(2, int(math.sqrt(10**5) + 1)):
    if primes[i]:
        j = 2
        while i * j <= 10**5:
            primes[i * j] = False
            j += 1
for i in range(2, 10**5 + 1):
    if primes[i] and primes[(i + 1) // 2]:
        cumsum[i] = cumsum[i - 1] + 1
    else:
        cumsum[i] = cumsum[i - 1]
Q = int(eval(input()))
for _ in range(Q):
    l, r = list(map(int, input().split()))
    print((cumsum[r] - cumsum[l - 1]))

MAX_INT = 10**5 + 1
primes = [True] * (10**5 + 1)
primes[0], primes[1] = False, False
for i in range(2, int(MAX_INT**0.5) + 1):
    if primes[i]:
        for j in range(i * 2, MAX_INT, i):
            primes[j] = False
cumsum = [0] * (10**5 + 1)
for i in range(1, 10**5 + 1, 2):
    if primes[i] and primes[(i + 1) // 2]:
        cumsum[i] = 1
for i in range(1, 10**5 + 1):
    cumsum[i] += cumsum[i - 1]
Q = int(eval(input()))
for _ in range(Q):
    l, r = list(map(int, input().split()))
    print((cumsum[r] - cumsum[l - 1]))

-import math - +MAX_INT = 10**5 + 1 +for i in range(2, int(MAX_INT**0.5) + 1): +    if primes[i]: +        for j in range(i * 2, MAX_INT, i): +            primes[j] = False -for i in range(2, int(math.sqrt(10**5) + 1)): -    if primes[i]: -        j = 2 -        while i * j <= 10**5: -            primes[i * j] = False -            j += 1 -for i in range(2, 10**5 + 1): +for i in range(1, 10**5 + 1, 2): -        cumsum[i] = cumsum[i - 1] + 1 -    else: -        cumsum[i] = cumsum[i - 1] +        cumsum[i] = 1 +for i in range(1, 10**5 + 1): +    cumsum[i] += cumsum[i - 1]