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) {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		int[] prime = new int[100001];
		prime[0] = 0;
		prime[1] = 0;
		prime[2] = 0;
		prime[3] = 1;
		prime[4] = 1;
		for (int i = 5; i < 100000; i = i + 2) {
			boolean b = true;
			for (int j = 2; j * j <= i; j++) {
				if (i % j == 0) {
					b = false;
					break;
				}
			}
			for (int j = 2; j * j <= (i + 1) / 2; j++) {
				if ((i + 1) / 2 % j == 0) {
					b = false;
					break;
				}
			}
			if (b) {
				prime[i] = prime[i - 1] + 1;
				prime[i + 1] = prime[i];
			} else {
				prime[i] = prime[i - 1];
				prime[i + 1] = prime[i - 1];
			}
		}

		int n = sc.nextInt();
		int l, r, cnt;
		for (int i = 0; i < n; i++) {
			l = sc.nextInt();
			r = sc.nextInt();
			sb.append(prime[r] - prime[l-1] + "\n");
		}
		System.out.print(sb);
	}
}
