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) {
		int[] x = new int[100001];
		for(int i=2;i<=100000;i++) {
			x[i] = 1;
		}
		for(int i=2;i<=100000;i++) {
			if(x[i]==0) continue;
			int j = i+i;
			while(j<=100000) {
				x[j] = 0;
				j += i;
			}
		}
		
		int[] like2017 = new int[100001];
		like2017[3] = 1;
		like2017[5] = 1;
		for(int i=9;i<=100000;i+=4) {
			if(x[i]==1 && x[(i+1)/2]==1) like2017[i] = 1;
		}
		for(int i=1;i<=100000;i++) {
			like2017[i] += like2017[i-1];
		}
		
		Scanner in = new Scanner(System.in);
		int q = in.nextInt();
		int[] l = new int[q];
		int[] r = new int[q];
		for(int i=0;i<q;i++) {
			l[i] = in.nextInt();
			r[i] = in.nextInt();
		}
		for(int i=0;i<q;i++) {
			System.out.println(like2017[r[i]]-like2017[l[i]-1]);
		}
		in.close();
	}

}
