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.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int q = Integer.parseInt(br.readLine());
        int[] count_2017like = new int[500005];
        count_2017like[0] = 0;
        count_2017like[1] = 0;
        count_2017like[2] = 0;
        
        boolean prime = true;
        for (int i = 3; i <= 500000; i += 2) {
            for (int j = 2; j <= Math.sqrt(i); j++) {
                if (i % j == 0) {
                    prime = false;
                    break;
                }
            }
            if (prime) {
                for (int k = 2; k <= Math.sqrt((i+1)/2); k++) {
                    if ((i+1)/2 % k == 0) {
                        prime = false;
                        break;
                    }
                }
                if (prime) {
                    count_2017like[i] = count_2017like[i-2] + 1;
                }
            }
            if (!prime) {
                count_2017like[i] = count_2017like[i-2];
            }
            prime = true;
        }
        
        /*System.out.println(count_2017like[5]);
        System.out.println(count_2017like[7]);
        System.out.println(count_2017like[9]);
        System.out.println(count_2017like[11]);
        System.out.println("");*/
        
        for (int i = 0; i < q; i++) {
            String[] lr = br.readLine().split(" ");
            int l = Integer.parseInt(lr[0]);
            if (l < 2) l++;
            int r = Integer.parseInt(lr[1]);
            if (r < 2) r++;
            System.out.println(count_2017like[r]-count_2017like[l-2]);
            //System.out.println(count_2017like[3]);
        }
    }
}
