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();
		}
		// エラトステネスの篩で素数を調べる
		int[] sosuu = new int[100010];
		for(int i = 3 ; i <= 100000 ; i++) {
			boolean ok = true;
			for(int j = 2 ; j * j <= i ; j++) {
				if(i == j) continue;
				if(i % j == 0 || ((i + 1) / 2) % j == 0) ok = false;
			}
			if(ok) sosuu[i]++;
		}
		int[] cnt = new int[100010];
		for(int i = 2 ; i < cnt.length ; i++) {
			cnt[i] = cnt[i - 1] + sosuu[i];
		}
		for(int i = 0 ; i < q ; i++) {
			System.out.println(cnt[r[i]] - cnt[l[i] - 1]);
		}
	}
}
