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.*;
import java.io.*;

public class Main {
	public static boolean composite[] = new boolean[100001];
	public static int total[] = new int[100001];
	public static void soe(int up) {
		int sqrt = (int)Math.sqrt(up);
		composite[1] = true;
		for(int i=2;i<=sqrt;i++) {
			if(!composite[i]) {
				for(int j=i*i;j<=up;j+=i) {
					composite[j] = true;
				}
			}
		}
	}
	
	public static void count(int up) {
		for(int i=3;i<=up;i++) {
			total[i] = total[i-1];
			if(i%2==0) {
				continue;
			}
			if(!composite[i]&&!composite[(i+1)/2]) {
				total[i]++;
			}
		}
	}
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		soe(100000);
		count(100000);
		int Q = Integer.parseInt(br.readLine());
		for(int i=1;i<=Q;i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			int l = Integer.parseInt(st.nextToken());
			int r = Integer.parseInt(st.nextToken());
			System.out.println(total[r]-total[l-1]);
		}
	}

}
