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.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args) throws Exception {
        int Q = Integer.parseInt(br.readLine().trim());
        int[][] lr = new int[Q][2];
        Boolean[] isPrime = new Boolean[100001];
        for (int i = 0; i < lr.length; i++) {
            lr[i] = inputval();
        }
        for (int i = 0; i < isPrime.length; i++) {
            isPrime[i] = true;
        }
        int x;
        for (int i = 2; i < (int) Math.sqrt(isPrime.length); i++) {
            x = 2;
            while (i * x < isPrime.length) {
                isPrime[i * x] = false;
                x++;
            }
        }
        isPrime[0] = false;
        isPrime[1] = false;


        int[] isLike2017 = new int[100001];
        int count = 0;
        for (int i = 0; i < isLike2017.length; i++) {
            isLike2017[i] = 0;
        }
        for (int i = 0; i < isLike2017.length; i++) {
            if (isPrime[i] && isPrime[(i+1)/2]){
                count++;
            }
            isLike2017[i] = count;

        }


        for (int i = 0; i < lr.length; i++) {
            System.out.println(isLike2017[lr[i][1]] - isLike2017[lr[i][0]-1]);
        }
    }


    static int[] inputval() throws Exception {
        String[] strarray = br.readLine().trim().split(" ");
        int[] intarray = new int[strarray.length];
        for (int i = 0; i < intarray.length; i++) {
            intarray[i] = Integer.parseInt(strarray[i]);
        }
        return intarray;
    }

    static void array_sout(int[][] array) {
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[0].length; j++) {
                System.out.print(array[i][j] + " ");
            }
            System.out.println();
        }
    }

    static void array_sout(int[] array) {
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
        System.out.println();
    }
}