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<cmath>
#include<iostream>
using namespace std;
int main(){
  const int n=100000;
  int b[n+2],m;
  cin>>m;
  b[0]=0;b[1]=0;b[2]=1;
  for(int i=3;i<=n;i++)
  	b[i]=(i%2==1);
  for(int i=3;i<=n;i+=2){
	  if(b[i])
		  for(int j=i*2;j<=n;j+=i)
		 	 b[j]=0;
  }
  for(int i=n-1;i>=3;i-=2){
	  if(b[i])
		b[i]=b[(i+1)/2];
  }
  b[2]=0;
	  for(int i=2;i<=n;i++)
	  	b[i]+=b[i-1];
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		cout<<b[y]-b[x-1]<<endl;
	}
  return 0;
}