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.stream.*;
import java.util.*;

public class Main {
    static Scanner scanner = new Scanner(System.in);

    public static void main(String[]$) {
        int q = scanner.nextInt();
        int[] l = new int[q];
        int[] r = new int[q];
        int max = 0;
        for (int i = 0; i < q; i++) {
            l[i] = scanner.nextInt();
            r[i] = scanner.nextInt();
            max = Math.max(max, r[i]);
        }
        Set<Integer> primes = getPrimes(max);
        int[] primeSum = new int[max + 1];

        for (int i = 1; i <= max; i++) {
            primeSum[i] = primeSum[i - 1];
            if (i % 2 == 1 && primes.contains(i) && primes.contains((i + 1) / 2)) {
                primeSum[i]++;
            }
        }

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

    static Set<Integer> getPrimes(int max) {
        Set<Integer> prime = new HashSet<>();
        if (max != 1) {
            List<Integer> target = IntStream.rangeClosed(3, max).filter(i -> i % 2 == 1).boxed().collect(Collectors.toList());
            prime.add(2);
            while (!target.isEmpty() && target.get(0) * target.get(0) <= max) {
                int i = target.get(0);
                prime.add(i);
                target.removeIf(num -> num % i == 0);
            }
            prime.addAll(target);
        }

        return prime;
    }
}