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
NUM = 10**5
prime = [True]*(NUM+1)
for i in range(2, int(NUM**0.5)+1):
    if not prime[i]:
        continue
    j = i*2
    while j <= NUM:
        prime[j] = False
        j += i

S = [0]*(NUM+1)
for i in range(3, NUM+1, 2):
    if prime[(i+1)//2] and prime[i]:
        S[i] = S[i-2] + 1
    else:
        S[i] = S[i-2]

Q = int(input())
for _ in range(Q):
    l, r = map(int, input().split())
    print(S[r]-S[l-2])

