#include<cstdio>
int main(){
	bool a[100001]={};
	for(int i=2;i<=100000;i++){
		a[i]=true;
	}
	a[0]=false;
	a[1]=false;
	for(int i=2;i<=100000;i++){
		if(a[i]==true){
			for(int j=i*2;j<=100000;j+=i){
				a[j]=false;
			}
		}
	}
	int b[50000]={};
	b[0]=0;
	for(int i=1;i<50000;i++){
		b[i]=b[i-1];
		if(a[2*i+1]&&a[i+1])b[i]++;
	}
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		int l,r;
		scanf("%d%d",&l,&r);
		l=(l-1)/2;
		if(l==0)l++;
		r=(r-1)/2;
		printf("%d\n",b[r]-b[l-1]);
	}
	return 0;
}
		
### Prompt

Create a solution in Cpp for the following problem:

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

### Response

```cpp
#include<cstdio>
int main(){
	bool a[100001]={};
	for(int i=2;i<=100000;i++){
		a[i]=true;
	}
	a[0]=false;
	a[1]=false;
	for(int i=2;i<=100000;i++){
		if(a[i]==true){
			for(int j=i*2;j<=100000;j+=i){
				a[j]=false;
			}
		}
	}
	int b[50000]={};
	b[0]=0;
	for(int i=1;i<50000;i++){
		b[i]=b[i-1];
		if(a[2*i+1]&&a[i+1])b[i]++;
	}
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		int l,r;
		scanf("%d%d",&l,&r);
		l=(l-1)/2;
		if(l==0)l++;
		r=(r-1)/2;
		printf("%d\n",b[r]-b[l-1]);
	}
	return 0;
}
		
```