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[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] qs = new int[n][2];
        int max = 0;
        for(int i = 0; i < n; i++) {
        	qs[i][0] = sc.nextInt();
        	qs[i][1] = sc.nextInt();
        	max = Math.max(max, qs[i][1]);
        }
        boolean[] primes = new boolean[max + 1];
        Arrays.fill(primes, true);
        for(int i = 2; i <= max; i++) {
        	if(!primes[i]) continue;
        	for(int j = i * 2; j <= max; j = j + i) {
        		primes[j] = false; 
        	}
        }
        int[] preSum = new int[max + 1];
        for(int i = 3; i <= max; i++) {
        	preSum[i] = preSum[i-1];
        	if(primes[i] && primes[(i + 1) / 2]) 
        		preSum[i]++;
        }

      	for(int[] q : qs) {
      		System.out.println(preSum[q[1]] - preSum[q[0] - 1]);
      	}
    }
}
