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) {
        Scanner sc  = new Scanner(System.in);

        int N = 101010;
        int [] is_prime = new int [N+1];

        for (int i = 2; i <= N; i++) is_prime[i] = 1;

        for (int i = 2; i <= N; i++) {
            if (is_prime[i] == 1) {
                for (int k = 2; i*k <= N; k++ ) is_prime[i*k] = 0;
            }
        }

        int [] a = new int [N];
        for (int i = 0; i < N; i++) {
            if (i % 2 == 0) continue; 
            if (is_prime[i] == 1 && is_prime[(i+1)/2] == 1 ) a[i] = 1;
        }

        int [] s = new int [N+1];
        for (int i = 0; i < N; i++) s[i+1] = s[i] + a[i];

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