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.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    private static final int MAX = 100000+24;
    private static boolean[] isPrime=new boolean[MAX];
    private static int[] Prime=new int[MAX];
    private static long[] Sum=new long[MAX];
    public static void makePrime(){
        Arrays.fill(isPrime,false);
        Arrays.fill(Sum,0);
        int tot=0; isPrime[1]=isPrime[0]=true;
        for(int i=2;i<MAX;i++){
            if(!isPrime[i]){
                Prime[tot++]=i;
            }
            for(int j=0;j<tot;j++){
                if(i*Prime[j]>=MAX) break;
                isPrime[i*Prime[j]] = true;
                if(i%Prime[j] == 0) break;
            }
            if( !isPrime[i] && !isPrime[(i+1)/2]){
                Sum[i]++;
            }
            Sum[i]+=Sum[i-1];
        }
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        makePrime();
        while(in.hasNext()) {
            int Q=in.nextInt();
            for(int i=1;i<=Q;i++){
                int l=in.nextInt(),r=in.nextInt();
                out.println(Sum[r]-Sum[l-1]);
            }
            out.flush();
        }
        in.close();
        out.close();
    }

}
