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;
long long n[50050],f[100050],zs,a,lefts,rights;
bool b[100050];
int main()
{
	b[0]=1,b[1]=1;
	for(int s=2;s<=100005;s++)
	{
		if(!b[s])
		{
			n[zs++]=s;
		}
		for(int v=0;v<zs;v++)
		{
			if(s*n[v]>100005)break;
			b[n[v]*s]=true;
			if(s%n[v]==0)break;
		}
	}
	cin>>a;
	for(int s=2;s<=100005;s++)
	{
		if(s%2==1&&b[s]==0&&b[(s+1)/2]==0)
		f[s]=1;
		f[s]+=f[s-1];
	}
	while(a--)//输入
	{
		cin>>lefts>>rights;
		cout<<f[rights]-f[lefts-1]<<endl;
	}
    return 0;
}