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

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    boolean[] primes = primes(100000);
    int[] num2017 = new int[100001];
    for (int i = 1; i <= 100000; i++) {
      num2017[i] = num2017[i - 1];
      if (i % 2 == 1 && primes[i] && primes[(i + 1) / 2]) num2017[i]++;
    }

    int Q = scanner.nextInt();
    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < Q; i++) {
      int l = scanner.nextInt();
      int r = scanner.nextInt();
      sb.append(num2017[r] - num2017[l - 1]).append('\n');
    }
    System.out.print(sb.toString());
  }

  public static boolean[] primes(int n) {
    boolean[] isNotPrime = new boolean[n + 1];
    isNotPrime[0] = isNotPrime[1] = true;
    for (int i = 2; i < Math.sqrt(n); i++) {
      if (!isNotPrime[i]) {
        for (int j = 2; i * j <= n; j++) {
          isNotPrime[i * j] = true;
        }
      }
    }
    boolean[] isPrime = new boolean[n + 1];
    for (int i = 0; i < n + 1; i++) {
      isPrime[i] = !isNotPrime[i];
    }
    return isPrime;
  }
}
