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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

import java.util.*;

public class Main {
    static int[] flag;
public static ArrayList<Integer> erathosthenes(int x) {
    int[] nums = new int[x];
    flag = new int[x];
    for (int i=2;i<x;i++) {
        nums[i]=i;
    }
    for (int i=2;i<Math.sqrt(x);i++) {
        if (flag[i]==1) {
            continue;
        }
        for (int j=2;j*i<x;j++) {
            flag[j*i]=1;
        }
    }
    ArrayList<Integer> ans = new ArrayList<Integer>();
    for (int i=2;i<x;i++) {
        if (flag[i]==0) {
            ans.add(nums[i]);
        }
    }
    return ans;
}
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        int[] isPrime = new int[100000+1];
        isPrime[1] = 1;
        for (Integer i : erathosthenes(100000)) {
            isPrime[i]=1;
        }
        int[] ruiseki = new int[100000+1];
        for (int i=2;i<100000;i+=2) {
            ruiseki[i+1] = ruiseki[i-1];
            if (isPrime[i+1]==1 && isPrime[(i+2)/2]==1) {
                ruiseki[i+1]++;
            }
        }
        int Q = in.nextInt();
        for (int i=0;i<Q;i++) {
            int l = in.nextInt();
            if (l==1) {
                l=2;
            }
            int r = in.nextInt();
            out.println(ruiseki[r]-ruiseki[l-2]);
        }

        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}
