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 {
	static int MAX = 100000;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int Q = in.nextInt();
		int[] primes = new int[MAX+1];
		int[] yes = new int[MAX+1];
		int[] wooh = new int[MAX+1];
		primes[0] = 1;
		primes[1] = 1;
		for( int i = 2; i <= MAX; i++ ) {
			if(primes[i] == 0) {
				for( int j = i*2; j <= MAX; j+=i ) {
					if(primes[i] == 0 ) primes[j] = 1;
				}
			}
		}
		yes[1] = 0;
		for( int i = 2; i <= MAX; i++ ) {
			if( primes[i] == 0 && primes[(int)((i+1)/2)] == 0 ) {
				yes[i] = 1;
			}
		}
		yes[2017] = 1;
		for( int i = 1; i <= MAX; i++ ) {
			wooh[i] = wooh[i-1] + yes[i];
		}
		// for( int i = 19; i <= 51; i++ ) {
		// 	System.out.print(yes[i]+", ");
		// }
		// System.out.println();
		// for( int i = 19; i <= 51; i++ ) {
		// 	System.out.print(wooh[i]+", ");
		// }
		// System.out.println();
		while( Q-- > 0 ) {
			int l = in.nextInt();
			int r = in.nextInt();
			System.out.println(wooh[r]-wooh[l-1]);
		}
	}
}