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

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int MAX = 101010;

        // エラトステネスのふるい
        int[] isPrime = new int[MAX];
        for (int i = 0; i < MAX; i++) isPrime[i] = 1;
        isPrime[0] = 0;
        isPrime[1] = 0;
        for (int i = 2; i < MAX; i++) {
            if (isPrime[i] == 0) continue;
            for (int j = i*2; j < MAX; j += i) isPrime[j] = 0;
        }

        // 2017-like
        int[] a = new int[MAX];
        for (int i = 0; i < MAX; i++) {
            if (i % 2 == 0) continue;
            if ((isPrime[i] & isPrime[(i+1)/2]) == 1) a[i] = 1;
        }

        // 累積和
        int[] s = new int[MAX+1];
        for (int i = 0; i < MAX; i++) s[i+1] = s[i] + a[i];

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