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

public class Main {
	private static final int MAX = 100000;

	public static void main(String[] args) {
		boolean[] notPrime = new boolean[MAX + 1];
		int[] like = new int[MAX + 1];

		notPrime[0] = true;
		notPrime[1] = true;
		for (int num = 2; num <= MAX; num++) {
			if (notPrime[num]) {
				like[num] = like[num - 1];
			}
			else {
				for (int i = (num * 2); i <= MAX; i += num) {
					notPrime[i] = true;
				}

				if (notPrime[(num + 1) / 2]) {
					like[num] = like[num - 1];
				}
				else {
					like[num] = like[num - 1] + 1;
				}
			}
		}

		@SuppressWarnings("resource")
		Scanner stdin = new Scanner(System.in);

		int inQ = stdin.nextInt();

		for (int i = 0; i < inQ; i++) {
			int inL = stdin.nextInt();
			int inR = stdin.nextInt();

			System.out.println(like[inR] - like[inL - 1]);
		}
	}
}
