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.*;

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

    public void run() {
        int Q = in.nextInt();

        boolean[] isPrime = new boolean[100100];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;
        for (int i = 2; i < isPrime.length; i++) {
            if (!isPrime[i]) continue;
            for (int j = i + i; j < isPrime.length; j += i) {
                isPrime[j] = false;
            }
        }

        int[] imos = new int[100100];
        for (int i = 2; i < imos.length; i++) {
            imos[i] = (isPrime[i] && isPrime[(i+1)/2]) ? 1 : 0;
        }
        for (int i = 2; i < imos.length - 1; i++) {
            imos[i+1] += imos[i];
        }

        for (int q = 0; q < Q; q++) {
            int l = in.nextInt(), r = in.nextInt();
            System.out.println(imos[r] - imos[l-1]);
        }
    }


    public static void main(String[] args) {
        new Main().run();
    }
}
