We say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.

You are given Q queries.

In the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.

Constraints

* 1≤Q≤10^5
* 1≤l_i≤r_i≤10^5
* l_i and r_i are odd.
* All input values are integers.

Input

Input is given from Standard Input in the following format:


Q
l_1 r_1
:
l_Q r_Q


Output

Print Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.

Examples

Input

1
3 7


Output

2


Input

4
13 13
7 11
7 11
2017 2017


Output

1
0
0
1


Input

6
1 53
13 91
37 55
19 51
73 91
13 49


Output

4
4
1
1
1
2
q=int(input())
n=10**5+10
d=[0]+[1 for _ in range(n)]

d[1]=0
f=2
while f*f<n+1:
  i=2
  while f*i<=n:
    d[f*i]=0
    i+=1
  f+=1
  while d[f]==0 and f*f<n+1:
    f+=1

e=[0 for _ in range(n+1)]
for i in range(1,n+1,2):
  if d[i]==1 and d[(i+1)//2]==1:
    e[i]=1

e[1]=0

import itertools
an=list(itertools.accumulate(e))

for i in range(q):
  l,r=map(int,input().split())
  print(an[r]-an[l-1])