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
#coding:utf-8
def isPrime(x):
    if x==1:return False
    if x==2 or x==3:return True
    if x%2==0:return False
    i=3
    while i*i<=x:
        if x%i==0:return False
        i+=2
    return True
pr=[None]*(10**5+1)
for i in range(10**5+1):
    pr[i]=isPrime(i)

#ary[l]:=#(1~l)
ary=[None]*(10**5+1)
ary[0]=0
ary[1]=0
ary[2]=0
for x in range(3,10**5+1):
    if pr[x] and pr[(x+1)/2]:
        ary[x]=ary[x-2]+1
    else:
        ary[x]=ary[x-2]
Q=input()
for i in range(Q):
    l,r=map(int,raw_input().split())
    if l!=1:
        print(ary[r]-ary[l-2])
    else:
        print(ary[r])


