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.lang.reflect.Array;
import java.util.*;


public class Main {
    static boolean[] isPrime;
    static int[] sumOf2017ishNum;

    static void createPrimeNumberList(int primeNumMax){
        isPrime = new boolean[primeNumMax+1];
        HashSet<Integer> checkedNumbers = new HashSet<Integer>();
        for(int i = 0; i <= primeNumMax; i++){
            if(checkedNumbers.contains(i) || i < 2){
                isPrime[i] = false;
            }else{
                isPrime[i] = true;
                int currentNum = i;
                while(currentNum <= primeNumMax){
                    checkedNumbers.add(currentNum);
                    currentNum += i;
                }
            }
        }
    }

    static void calculateSumOf2017ish(int primeNumMax){
        sumOf2017ishNum = new int[primeNumMax+1];
        sumOf2017ishNum[0] = 0;
        for(int i = 1; i <= primeNumMax; i++){
            int p = (i+1) / 2;
            if(isPrime[i] && isPrime[p]){
                sumOf2017ishNum[i] = sumOf2017ishNum[i-1] + 1;
            }else {
                sumOf2017ishNum[i] = sumOf2017ishNum[i-1];
            }
        }
    }

    static void solve(){
        Scanner sc = new Scanner(System.in);
        int primeNumMax = 100000;
        createPrimeNumberList(primeNumMax);
        calculateSumOf2017ish(primeNumMax);
        int n = sc.nextInt();
        for (int i = 0; i < n; i++){
            int l = sc.nextInt();
            int r = sc.nextInt();
            int count = sumOf2017ishNum[r] - sumOf2017ishNum[l-1];
            System.out.println(count);
        }
    }
    public static void main(String[] args){
        solve();
    }
}
