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

class Main{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int siz=100001;
    int q=sc.nextInt();
    boolean[] p=new boolean[siz];
    Arrays.fill(p,true);
    boolean[] l=new boolean[siz];
    int[] wa=new int[siz+1];
    p[0]=p[1]=false;
    for(int i=2;i<siz;i++){
      if(!p[i]){
        continue;
      }
      for(int j=i+i;j<siz;j+=i){
        p[j]=false;
      }
    }
    for(int i=1;i<siz;i+=2){
      if(p[i]&&p[(i+1)/2]){
        l[i]=true;
      }
    }
    for(int i=0;i<siz;i++){
      if(l[i]){
        wa[i+1]=wa[i]+1;
      }else{
        wa[i+1]=wa[i];
      }
    }
    for(int i=0;i<q;i++){
      int a=sc.nextInt();
      int b=sc.nextInt();
      System.out.println(wa[b+1]-wa[a]);
    }
  }
}