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())
Qs=[list(map(int,input().split())) for _ in range(Q)]
Prime=[0]*100001
count=0

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

for i in range(3, 100001, 2):
    if Isprime(i) and Isprime((i+1)//2):
        Prime[i]=1
        count+=1

for i in range(1,100001):
    Prime[i]=Prime[i]+Prime[i-1]

for q in Qs:
    print(Prime[q[1]]-Prime[q[0]-1])