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
#include <bits/stdc++.h>
using namespace std;
const int R = 100000+10;
int bit[R], npri[R];

int main(){
npri[0]=npri[1]=1;
for(int i=2;i<R;++i) if(npri[i]==0) for(long long j=(long long)i*i; j<R; j+=i) npri[j]=1;

for(int i=1;i<R;i+=2) bit[i] = (npri[i]==0)&&(npri[(i+1)/2]==0);
for(int i=1;i<R;++i) bit[i]+=bit[i-1];

int q, le, ri;
cin>>q;
for(int _c=0; _c<q; _c++){
cin>>le>>ri;
cout<<bit[ri]-bit[le-1]<<endl;
}


return 0;
}