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<stdio.h>
#include<math.h>
int mun[10000];
int k=0;

int main (){
   int i=3,j;
   int n=0,a,b;for(i=3;i<1e5;i+=2){
 	for(j=2;j<=sqrt(i);j++){
 		if(i%j==0){
 			i+=2;j=2;
		 }else for(int l=2;l<=sqrt((i+1)/2);l++) if((i+1)%(l*2)==0){
		 		i+=2;j=2;break;
		 }
	 }
mun[k]=i;k++;
 }
   scanf("%d",&n);
   while(n--){
   scanf("%d %d",&a,&b);
   int sum=0;
   for(int i=0;i<1e4;i++){if(mun[i]>b)break;
   	if(mun[i]>=a&&mun[i]<=b) {sum++;
	   }
   }
printf("%d\n",sum);
} }