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);
		boolean[] isPrime=new boolean[100001];
		int[] c=new int[100001];
		for(int i=2;i<=100000;i++) {
			isPrime[i]=true;
		}
		for(int i=2;i<=100000;i++) {
			c[i]=c[i-1];
			if(isPrime[i]) {
				for(int j=2*i;j<=100000;j+=i) {
					isPrime[j]=false;
				}
				if(isPrime[(i+1)/2])c[i]++;
			}
		}
//		for(int i=2;i<=10;i++) {
//		System.out.println(c[i]);
//		}
		int Q = sc.nextInt();
		for(int q=1;q<=Q;q++) {
			int l=sc.nextInt();
			int r=sc.nextInt();
			System.out.println(c[r]-c[l-1]);
		}
	}

	private static boolean isPrime(int i) {
		// TODO 自動生成されたメソッド・スタブ
		double rooti=Math.pow(i, 0.5);
		for(int j=3;j<=rooti;j+=2) {
			if(i%j==0) {
				return false;
			}
		}
		return true;
	}
}
//3 5 13 37 61 73
