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
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
  vector<bool> A(100001,true);
  A[0]=false,A[1]=false;
  for(int i=2;i<=320;i++){
    if(!A[i])
      continue;
    for(int j=2;i*j<=100001;j++)
      A[i*j]=false;
  }
  vector<int> B(100002,0);
  for(int i=3;i<100002;i+=2){
    B[i+1]=B[i-1];
    if(A[i] && A[(i+1)/2])
      B[i+1]++;
  }
  int Q;
  cin>>Q;
  for(int i=0;i<Q;i++){
    int l,r;
    cin>>l>>r;
    cout<<B[r+1]-B[l-1]<<endl;
  }
}