Recently, the bear started studying data structures and faced the following problem.

You are given a sequence of integers *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> of length *n* and *m* queries, each of them is characterized by two integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>. Let's introduce *f*(*p*) to represent the number of such indexes *k*, that *x*<sub class="lower-index">*k*</sub> is divisible by *p*. The answer to the query *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> is the sum: <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/5e448f6c1a0e40843cecdbbeb95970464626032f.png" style="max-width: 100.0%;max-height: 100.0%;"/>, where *S*(*l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>) is a set of prime numbers from segment [*l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>] (both borders are included in the segment).

Help the bear cope with the problem.
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>). The second line contains *n* integers *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (2 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">7</sup>). The numbers are not necessarily distinct.

The third line contains integer *m* (1 ≤ *m* ≤ 50000). Each of the following *m* lines contains a pair of space-separated integers, *l*<sub class="lower-index">*i*</sub> and *r*<sub class="lower-index">*i*</sub> (2 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ 2·10<sup class="upper-index">9</sup>) — the numbers that characterize the current query.
using System;

class Solution{
	static void Main(){
		int n = int.Parse(Console.ReadLine());
		string[] xi = Console.ReadLine().Split(' ');
		int[] x = new int[n];
		for(int i=0;i<n;i++)
			x[i] = int.Parse(xi[i]);
		int limit = 10000000;
		int[] primesum = new int[limit+1];
		foreach(int e in x){
			int ex = e;
			int i=2;
			int addedno = -1;
			while(ex >= i*i){
				if(ex%i == 0){
					if(addedno != i){
						primesum[i] += 1;
						addedno = i;
					}
					ex = ex/i;
				}
				else{
					i++;
					addedno = -1;
				}
			}
			if(addedno != ex)
				primesum[ex] += 1;
		}
		for(int i=2; i<limit+1; i++)
			primesum[i] = primesum[i] + primesum[i-1];
		int m = int.Parse(Console.ReadLine());
		for(int i=0; i<m;i++){
			int l,r;
			string[] ilr = Console.ReadLine().Split(' ');
			l = int.Parse(ilr[0]);
			r = int.Parse(ilr[1]);
			Console.WriteLine(primesum[r] - primesum[l-1]);
		}
	}
}
