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) {
		Scanner scanner = new Scanner(System.in);
		int N = scanner.nextInt();
		int[] A =new int[N];
		int[] B = new int[N];
		boolean[] flag = new boolean[100001];
		flag[0] = true;
		flag[1] = true;

		int[]dp = new int[100001];
		dp[0] = dp[1] = 0;

		for(int i = 0; i < N; i++) {
			A[i] = scanner.nextInt();
			B[i] = scanner.nextInt();
		}
		for(int i = 2;i < 100001;i++){
			if(flag[i]){					//flag立ってたら前と一緒
				dp[i] = dp[i-1];
				continue;
			}
			if(!flag[(i+1)/2]){
				dp[i] = dp[i-1]+1;
			}else{
				dp[i] = dp[i-1];
			}
			for(int j = i*2;j < 100001;j+=i){			//倍数全部flag立てる
				flag[j] = true;
			}
		}
		for(int i = 0; i < N; i++) {
			System.out.println(dp[B[i]] - dp[A[i] - 1]);
		}

	}



}

