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.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		/**
		 * エラトステネスの篩
		 */
		int MAX = 101010;
		boolean[] isPrime = new boolean[MAX];
		Arrays.fill(isPrime, true);
		isPrime[0] = false;
		isPrime[1] = false;

		for (int i = 2; i <= Math.sqrt(MAX); i++) {
			if (!isPrime[i]) { // 素数でない場合は見ない
				continue;
			}
			for (int j = i * 2; j < MAX; j += i) { // 倍数を除く
				isPrime[j] = false;
			}
		}

		// 2017-like number
		int[] isLike = new int[MAX];
		for (int i = 3; i < MAX; i = i + 2) {
			if (isPrime[i] && isPrime[(i + 1) / 2]) {
				isLike[i] = 1;
			}
		}

		// 累積和
		int[] cs = new int[MAX + 1];
		for (int i = 1; i < MAX; i++) {
			cs[i] = cs[i - 1] + isLike[i];
		}

		int Q = sc.nextInt();
		int[] numLikeCnt = new int[Q];

		for (int i = 0; i < Q; i++) {
			int l = sc.nextInt();
			int r = sc.nextInt();
			numLikeCnt[i] = cs[r] - cs[l - 1];
		}

		for (int c : numLikeCnt) {
			System.out.println(c);
		}

		sc.close();
	}

}
