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;

class Main{
	public static void main(String[] args) {
		int[] isPrime=new int[100002];

		for(int i=1; i<=100001; i+=2) {
			if(isPrime(i) && isPrime((i+1)/2)) {
				isPrime[i]=1;
			}
		}

		for(int i=1; i<=100001; i++) {
			isPrime[i]=isPrime[i-1]+isPrime[i];
		}
		Scanner sc=new Scanner(System.in);

		int Q=sc.nextInt();

		for(int i=0; i<Q; i++) {
			int s=sc.nextInt();
			int g=sc.nextInt();
			System.out.println(isPrime[g]-isPrime[s-1]);
		}
	}

	public static boolean isPrime(int a) {

		if(a<4) {

			if(a==2 || a==3) {
				return true;
			}
			else {
				return false;
			}
		}
		else {
			for(int j=2; j*j<=a; j++) {
				if(a%j==0) {
					return false;
				}
				if(a%j!=0 && (j+1)*(j+1)>a) {
					return true;
				}
		}
		return true;
		}
	}
}