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.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Main {

    public static void main(String[] args) {
        Set<Integer> primeSet = new HashSet<Integer>();
        primeSet.add(2);
        for (int i = 3; i <= 100000; i += 2) {
            boolean isPrime = true;
            for (int j = 2; j <= Math.sqrt(i); j++) {
                if (i % j == 0) {
                    isPrime = false;
                    break;
                }
            }
            if (isPrime) {
                primeSet.add(i);
            }
        }

        Map<Integer, Integer> like2017Map = new HashMap<Integer, Integer>();
        like2017Map.put(-1, 0);
        int count = 0;
        for (int i = 1; i <= 100000; i += 2) {
            if (primeSet.contains(i) && primeSet.contains((i + 1) / 2)) {
                count++;
            }
            like2017Map.put(i, count);
        }

        Scanner scan = new Scanner(System.in);
        int q = Integer.parseInt(scan.next());
        for (int i = 0; i < q; i++) {
            int l = Integer.parseInt(scan.next());
            int r = Integer.parseInt(scan.next());
            System.out.println(like2017Map.get(r) - like2017Map.get(l - 2));
        }
        scan.close();
    }
}
