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
import java.util.*;
import java.util.Map.Entry;
 
class Main {
	 static int mod =  (int) (Math.pow(10,9)+7);
//	 static int mod = 998244353;
	 public static void main(String[] args) {
	        Scanner sc = new Scanner(System.in);
	        long Q = sc.nextLong();
	        
	        int H = 100000;
	        int[] m = new int[H];
	        int[] p = new int[H];
	        int[] mlike=new int[H];
	        int k=0;
		m[1]=-1;
	        for(int i=2;i<H;i++) {
	        	if(m[i]==0) {
	        		m[i]=1;
	        		if(m[(i+1)/2]==1) {
	        			mlike[i]=1;
	        		}
	        		p[k]=i;
	        		k++;
	        		for(int j=i+i;j<H;j=j+i) {
	        			m[j]=i;
	        		}
	        	}
	        }
	        
	        int[] likesum=new int[H];
	        for(int i=1;i<H;i++) {
	        	if(mlike[i]==1) {
	        		likesum[i]=likesum[i-1]+1;
	        	} else {
	        		likesum[i]=likesum[i-1];
	        	}
	        }
	        
	        StringBuffer str=new StringBuffer();
	        for(int i=0;i<Q;i++) {
	        	int l=sc.nextInt();
	        	int r=sc.nextInt();
	        	int sum=0;
	        	
	        	str.append(likesum[r]-likesum[l-1]);
	        	str.append("\n");
	        }
	        System.out.println(str);
	 }
	 

}