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.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
      int Q = sc.nextInt();
      int[][] q = new int[Q][2];
      for(int i=0; i<Q; i++){
        q[i][0] = sc.nextInt();
        q[i][1] = sc.nextInt();
      }	
      //1~99999の中で、「2017」に似ていれば1、そうでなければ0のリストを生成する
      //配列[i]に対し、i*2+1 へ判定を行う。 例：i=0, 1  i=5 11
      int[] near = new int[50000];
      for(int i=0; i<near.length; i++) {
    	  int num = i * 2 + 1;
    	  near[i] = isNear2017(num);
      }
      //累積和のリストを生成
      //ruiseki[i] = near[i-1]までの合計
      int[] ruiseki = new int[50001];
      ruiseki[0] = 0;
      for(int i=0; i< near.length; i++) {
    	  ruiseki[i + 1] = ruiseki[i] + near[i];
      }
      
      for(int i=0; i<Q; i++) {
    	  int left = q[i][0] / 2;
    	  int right = q[i][1] / 2 + 1;
    	  int ans = ruiseki[right] - ruiseki[left];
    	  System.out.println(ans);  	  
      }

      
	}
	//Nが「2017に似ている」かどうかを調べる。似ていれば１、そうでなければ０を返す
    public static int isNear2017(int n) {
    	if (n == 1) return 0;
    	int r = 1;
    	int nPlus = (n + 1)/2;
    	for(int i=2; i<nPlus; i++) {
    		if(r == 0) break;
    		if(n%i==0)  r = 0;
    		if(nPlus%i==0) r=0;
    	}
    	for(int i= nPlus; i<n; i++) {
    		if(r == 0) break;
    		if(n%i==0) r=0;
    	}
    	return r;
    }
}