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>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define endl "\n"
using ll=long long;
using namespace std;
ll l[110000],r[110000],p[110000],q[110000],sum[110000];
int main(){
  ll n;
  cin>>n;
  rep(i,0,n)cin>>l[i]>>r[i];
  rep(i,2,100001)p[i]=1;
  rep(i,2,100001){
    if(p[i]==1){
      for(ll j=i*2;j<=100001;j+=i)p[j]=0;
    }
  }
  rep(i,2,100001){
    if(p[i]&&p[(i+1)/2])q[i]=1;
    sum[i]+=sum[i-1]+q[i];
  }
  rep(i,0,n)cout<<sum[r[i]]-sum[l[i]-1]<<endl;
}