#include<stdio.h>
#include<math.h>
#define N 100000
int a[100005]={0}; 
int main()
{
	a[1]=0;
	for(int i=2;i<=sqrt(N);i++)
	{
		if(a[i]==0)
		{
			for(int j=i*i;j<=N;j+=i)
				a[j]=1;	
		}
	}
	int p[100005];
	p[0]=1;
	p[1]=1;
	for(int i=3;i<=N;i+=2)
	{
		p[i]=p[i-2];
		if(a[i]==0&&a[(i+1)/2]==0)
			p[i]+=1;
	}
	
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		if(x==1)
			x=2;
		printf("%d\n",p[y]-p[x-2]);
	}
	
	
	return 0;
}
### Prompt

In cpp, your task is to solve 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<stdio.h>
#include<math.h>
#define N 100000
int a[100005]={0}; 
int main()
{
	a[1]=0;
	for(int i=2;i<=sqrt(N);i++)
	{
		if(a[i]==0)
		{
			for(int j=i*i;j<=N;j+=i)
				a[j]=1;	
		}
	}
	int p[100005];
	p[0]=1;
	p[1]=1;
	for(int i=3;i<=N;i+=2)
	{
		p[i]=p[i-2];
		if(a[i]==0&&a[(i+1)/2]==0)
			p[i]+=1;
	}
	
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		if(x==1)
			x=2;
		printf("%d\n",p[y]-p[x-2]);
	}
	
	
	return 0;
}
```