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);

		int q = sc.nextInt();
		int[] l = new int[q];
		int[] r = new int[q];
		for (int i = 0; i < q; i++) {
			l[i] = sc.nextInt();
			r[i] = sc.nextInt();
		}

		boolean[] isPrimeNum = new boolean[100001];
		for (int i = 1; i <= 100000; i += 2) {
			isPrimeNum[i] = true;
		}
		isPrimeNum[0] = false;
		isPrimeNum[1] = false;
		isPrimeNum[2] = true;
		for (int i = 3; i * i <= 100000; i += 2) {
			if (isPrimeNum[i] == true) {
				for (int j = i * i; j <= 100000; j += i * 2) {
					isPrimeNum[j] = false;
				}
			}
		}

		int[] numOfLikeNumber = new int[100001];
		numOfLikeNumber[1] = 0;
		numOfLikeNumber[2] = 0;
		numOfLikeNumber[3] = 1;
		for (int i = 4; i <= 100000; i++) {
			numOfLikeNumber[i] = numOfLikeNumber[i - 1];
			if (i % 4 == 1) {
				if (isPrimeNum[i] && isPrimeNum[(i + 1) / 2]) {
					numOfLikeNumber[i]++;
				}
			}
		}

		for (int i = 0; i < q; i++) {
			System.out.println(numOfLikeNumber[r[i]] - numOfLikeNumber[l[i] - 1]);
		}

	}

}
