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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a[] = Eratos(1000000);
		int q = sc.nextInt();
		for (int i = 1; i <= q; i++) {
			int l = sc.nextInt();
			int r = sc.nextInt();
			int anss, ansg;
			anss = 1;
			ansg = 2;
			for (int o = 1; o <= a.length; o++) {
				if (a[o] < l && l <= a[o + 1]) {
					anss = o + 1;
				}
				if (a[o] <= r && r < a[o + 1]) {
					ansg = o;
					break;
				}
			}
			System.out.println(ansg - anss + 1);
		}

	}

	static public int[] Eratos(int n) {

		int num[] = new int[n + 1];
		Arrays.fill(num, 0);

		ArrayList<Integer> sosu = new ArrayList<Integer>();
		for (int i = 2; i <= n; i++) {
			if (num[i] == 0) {
				for (int j = i + i; j <= n; j = j + i) {
					if (j % i == 0) {
						num[j] = 1;
					}
				}
			}
		}

		for (int i = 1; i <= n; i++) {
			if (num[i] == 0 && num[(i + 1) / 2] == 0 && i != 2) {
				sosu.add(i);
			}
		}

		int[] so = new int[sosu.size()];

		for (int i = 0; i < sosu.size(); i++) {
			so[i] = sosu.get(i);
		}

		return so;
	}

}