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

public class Main {

	static Scanner scanner;

	public static void main(String[] args) {
	    scanner = new Scanner(System.in);

	    int Q=gi();
	    int[] L=new int[Q];
	    int[] R=new int[Q];

	    int max=0;
	    for (int i=0; i<Q;i++) {
	    	L[i]=gi();
	    	R[i]=gi();
	    	max=Math.max(max, R[i]);
	    }

	    boolean[] isP=new boolean[max+1];

	    for (int i=2; i<(max+1);i++) {
	    	isP[i]=true;
	    }
	    for (int i=2; i<(max+1)/2;i++) {
	    	if(isP[i]) {
	    		int v=i;
	    		while(v+i<max+1) {
	    			v+=i;
	    			isP[v]=false;
	    		}
	    	}
	    }

	    int[] pn=new int[max+1];
	    int n=0;
	    for (int i=1; i<max+1;i++) {
	    	if(i%2==1 && isP[i] && isP[(i+1)/2])n++;
	    	pn[i]=n;
	    }

	    for(int i=0; i<Q;i++) {
	    	System.out.println(pn[R[i]]-pn[L[i]-1]);
	    }
        //System.out.println(ans);
	}

	// 文字列として入力を取得
	public static String gs() {
		return scanner.next();
	}

	// intとして入力を取得
	public static int gi() {
		return Integer.parseInt(scanner.next());
	}

	// longとして入力を取得
	public static long gl() {
		return Long.parseLong(scanner.next());
	}

	// doubleとして入力を取得
	public static double gd() {
		return Double.parseDouble(scanner.next());
	}
}