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.*;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] l = new int[n];
    int[] r = new int[n];
    for(int i =0; i < n; i++){
      l[i] = sc.nextInt();
      r[i] = sc.nextInt();
    }
    int[] a = Arrays.copyOf(r, r.length);
    Arrays.sort(a);
    int max = a[a.length-1];
    List<Integer> list = likeMake(sosuMake(max));
    for(int i = 0; i < n; i++){
      Integer lt = l[i];
      Integer rt = r[i];
      int low = Collections.binarySearch(list, lt);
      int high = Collections.binarySearch(list, rt);
      if(low < 0){
        low = ~low;
      }
      if(high < 0){
        high = ~high;
      }else{
        high++;
      }
      System.out.println(high - low);
    }
  }
  
  public static List<Integer> sosuMake(int max){
    List<Integer> list = new ArrayList<>();
    list.add(2);
    for(int i = 3; i <= max; i += 2){
      for(int j = 0; j < list.size(); j++){
        int tmp = list.get(j);
        if(tmp * tmp > i){
          list.add(i);
          break;
        }else if(i % tmp == 0){
          break;
        }
      }
    }
    return list;
  }
  
  public static List<Integer> likeMake(List<Integer> sosu){
    List<Integer> list = new ArrayList<>();
    for(int num : sosu){
      if(num == 2) continue;
      Integer tmp = (num + 1) / 2;
      if(Collections.binarySearch(sosu, tmp) >= 0){
        list.add(num);
      }
    }
    return list;
  }
}