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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main
{

  public static void main(String[] args) throws IOException
  {
    BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);

    int q = Integer.parseInt(r.readLine());
    int[] left = new int[114514];
    int[] right = new int[114514];
    boolean[] furui = new boolean[114514];
    Arrays.fill(furui, true);
    int[] nem = new int[114514];

    for(int i = 0; i < q; i++)
    {
      String[] sl = r.readLine().split("[\\s]+");
      left[i] = Integer.parseInt(sl[0]);
      right[i] = Integer.parseInt(sl[1]);
    }

    furui[0] = furui[1] = false;
    for(int i = 2; i < 114514; i++)
    {
      if(furui[i])
      {
        for(int j = i * 2; j < 114514; j += i)
        {
          furui[j] = false;
        }
      }
    }


    int nemui = 0;
    for(int i = 0; i < 114514; i++)
    {
      if(furui[i] && furui[(i + 1) / 2])
      {
        nemui++;
      }
      nem[i] = nemui;
    }

    for(int i = 0; i < q; i++)
    {
      System.out.println(nem[right[i]] - nem[left[i] - 1]);
    }
  }

}
