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
l=[0]*(10**5)
for i in range(1,10**5+1):
  for j in range(2,int(i**0.5)+1):
    if i%j==0:
      break
  else:
    l[i-1]=1
  
d=[0]*(10**5)
t=3
while t<=10**5:
  if l[t-1]==1 and l[(t-1)//2]==1:
    d[t-1]=1
  t+=2

r=[0]*(10**5+1)
for i in range(10**5):
  r[i+1]=r[i]+d[i]
  

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