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 {
	public static void main(String[]args) {
		try(Scanner scan = new Scanner(System.in)){
			
			int Q = scan.nextInt();
			int []l = new int[Q];//奇数
			int []r= new int[Q];//奇数
			for(int i = 0;i<Q;i++) {
				l[i] = scan.nextInt();
				r[i] = scan.nextInt();
			}
			
			long[]s = new long[100002];
			
			for(int i = 0;i<100001;i++) {
				if(isprime(i)&&isprime((i+1)/2)) {
					s[i+1] = s[i]+1;
				}else {
					s[i+1] = s[i];
				}
				
			}
			
			for(int i = 0;i<Q;i++) {
				
				System.out.println(s[r[i]+1]-s[l[i]]);
				
			}
			
			
			
		}
		
		
	}
		private static boolean isprime(long x) {//素数判定、入力xが素数かtrue,falseで返す
		long i;
		if(x<2)return false;//まず２より小さいのは素数じゃない
		if(x==2)return true;//２は素数
		if(x%2==0)return false;//２で割り切れたら素数じゃない
		for(i =3;i*i<=x;i = i+2) {//それ以降iで割り切れたら素数じゃない
			if(x%i==0)
				return false;
		}
		return true;//for文回しても割り切れなかったらそれは素数
	}

}