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 {
	static int MAX = 100001;
	static boolean[] isPrime = new boolean[MAX];
	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();
		}
		sc.close();
		aryPrime();
		int[] c = new int[MAX];
		for(int i = 3; i < 100000; i++) {
			if(isPrime[i]) {
				if(isPrime[(i + 1) / 2]) {
					c[i] = c[i - 1] + 1;
				}else {
					c[i] = c[i - 1];
				}
			}else {
				c[i] = c[i - 1];
			}
		}
		StringBuilder sb = new StringBuilder();
		for(int i = 0; i < Q; i++) {
			int cnt = c[r[i]] - c[l[i] - 1];
			sb.append(cnt).append("\n");
		}
		System.out.print(sb.toString());
//		for(int i = 0; i < 15; i++) {
//			System.out.println(i + " " + c[i]);
//		}
//		for(int p = 3; p < 10; p++) {
//			if(isPrime[p]) {
//				System.out.println(p);
//			}
//		}
	}
	static void aryPrime(){
        int l = isPrime.length;
        for(int i = 0; i < l; i++) {
            isPrime[i] = true;
        }
        isPrime[0] = false;
        isPrime[1] = false;
        isPrime[2] = true;
        int max = (int)Math.sqrt(l);
        for(int i = 2; i <= max; i++) {
            if(isPrime[i]) {
                for(int j = i * 2; j < l; j += i) {
                    isPrime[j] = false;
                }
            }
        }
    }
}