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.*;

class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();
        int[] l = new int[Q+1];
        int[] r = new int[Q+1];
        int rmax = Integer.MIN_VALUE;
        for(int i=1;i<=Q; i++){
            l[i] = sc.nextInt();
            r[i] = sc.nextInt();
            rmax = Math.max(rmax,r[i]);
        }
        boolean[] primeRecord = new boolean[rmax+2];
        primeRecord[2]=true;
        for(int i=3;i<=rmax+1; i++){
            if((i&1)==0||(!isPrime(i)))continue;
            primeRecord[i] = true;
        }
        int[] rec2017 = new int[rmax+2];
        for(int i=3;i<=rmax+1; i++){
            if((i&1)==1&&primeRecord[i]&&primeRecord[(i+1)/2]){
                rec2017[i] =rec2017[i-1]+1;
            }
            else rec2017[i] = rec2017[i-1];
        }
        for(int i=1; i<=Q; i++){
            int ans;
            int left = l[i];
            int right = r[i];
            if((left&1)==0) left++;
            if((right&1)==0) right--;
            if(right<left) ans = 0;
            else{
                ans = rec2017[right]-rec2017[left-1];
            }
            System.out.println(ans);
        }
    }
    private static boolean isPrime(int target){
        int upper = (int) Math.sqrt(target)+1;
        for(int i=2; i<= upper; i++){
            if(target%i==0) return false;
        }
        return true;
    }
}