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 N = 100_001;
		boolean[] prime = new boolean[N+1];
		Arrays.fill(prime, true);
		prime[0] = prime[1] = false;
		for(int x = 4; x <= N; x+=2)
			prime[x] = false;
		for(int i = 3; i <= Math.sqrt(N); i+=2)
			if(prime[i])
				for(int x = i * i; x <= N; x+=i)
					prime[x] = false;
		int[] S = new int[N];
		for(int i = 1; i < N; i++) {
			S[i] = S[i-1];
			if(i % 2 != 0 && prime[i] && prime[(i+1)/2])
				S[i]++;
		}
		for(int q = 0; q < Q; q++) {
			int l = sc.nextInt();
			int r = sc.nextInt();
			System.out.println(S[r] - S[l-1]);
		}
	}

}