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.ByteArrayInputStream;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    static String INPUT = "";

    public static void main(String[] args) {
        InputStream is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());

        Scanner scanner = new Scanner(is);

        final int q = scanner.nextInt();
        List<LR> lr = new ArrayList<>();
        for (int i = 0; i < q; i++) {
            lr.add(new LR(scanner.nextInt(), scanner.nextInt()));
        }

        boolean[] sieve = primeSieve(100001);
        List<Integer> ret = solve(sieve, lr);
        for (int r : ret) {
            System.out.println(r);
        }
    }

    static List<Integer> solve(boolean[] sieve, List<LR> lrList) {
        List<Integer> ret = new ArrayList<>();
        List<Integer> primeIndex = similarPrimeIndex(sieve);
        for (LR ele : lrList) {
            int count = 0;

            for (int index : primeIndex) {
                if (ele.l <= index && index <= ele.r) {
                    count++;
                }
                if (ele.r < index) {
                    break;
                }
            }

            ret.add(count);
        }
        return ret;
    }

    static List<Integer> similarPrimeIndex(boolean[] sieve) {
        List<Integer> primeIndex = new ArrayList<>();
        for (int i = 1; i < sieve.length; i += 2) {
            if (sieve[i] && sieve[(i + 1) / 2]) {
                primeIndex.add(i);
            }
        }
        return primeIndex;
    }

    static class LR {
        int l;
        int r;

        LR(int l, int r) {
            this.l = l;
            this.r = r;
        }
    }

    static boolean[] primeSieve(int n) {
        boolean[] isPrime = new boolean[n];
        for (int i = 0; i < isPrime.length; i++) {
            isPrime[i] = true;
        }
        isPrime[1] = false;
        int limit = (int) Math.ceil(Math.sqrt(n));
        for (int i = 2; i < limit; i++) {
            for (int j = 2; j * i < n; j++) {
                isPrime[j * i] = false;
            }
        }
        return isPrime;
    }
}
