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) {
       new Solver().run();
   }

}


class Solver {

    private boolean isPrime(long n) {
        if (n == 0 || n == 1) return false;
        if (n == 2) return true;

        if (n % 2 == 0) return false;

        for (long i = 3; i * i <= n; i+=2) {
            if (n % i == 0) return false; 
        }   
        return true;
    } 

 
    private boolean isLikely2017(int n) {
        if (n == 2) return false;
        return isPrime(n) && isPrime((n + 1) / 2);
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();
        int[] l = new int[Q];
        int[] r = new int[Q];
        for (int i = 0; i < Q; i++) {
            l[i] = sc.nextInt();
            r[i] = sc.nextInt();
        }

        int[] S = new int[100002];
        S[0] = 0;
        for (int i = 1; i < 100002; i++) {
            if (isLikely2017(i)) {
                S[i] = S[i - 1] + 1;
            } else {
                S[i] = S[i - 1];
            }
        }

        //for (int i = 0; i < 10; i++) {
        //    System.out.println(String.format("S[%d]=%d ", i, S[i]) + isPrime(i));
        //}


        for (int i = 0; i < Q; i++) {
           int ans  = S[r[i] + 1] - S[l[i] - 1];
           System.out.println(ans);
        }


    }
}