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;

class Solver {
    public void Solve() {
        int q = sc.nextInt();
        int ruiseki[] = new int[200_000];
        ruiseki[0] = 0;

        // エストラテネスの揮
        int minFact[] = new int[200_000];
        for (int i = 2; i < minFact.length; i++) {
            if (minFact[i] == 0) {
                for (int j = i; j < minFact.length; j += i) {
                    minFact[j] = i;
                }
            }
        }

        for (int i = 1; i < ruiseki.length; i++) {
            if ((minFact[i] == i) && minFact[(i + 1) / 2] == (i + 1) / 2) {
                ruiseki[i] = ruiseki[i - 1] + 1;
            } else {
                ruiseki[i] = ruiseki[i - 1];
            }
        }
        for (int i = 0; i < q; i++) {
            int l = sc.nextInt();
            int r = sc.nextInt();
            int ans = ruiseki[r] - ruiseki[l - 1];
            System.out.println(ans);
        }

    }

    Scanner sc;

    Solver(Scanner in) {
        this.sc = in;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Solver s = new Solver(sc);
        s.Solve();
        sc.close();
    }
}
