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.
from math import floor, sqrt

def simpleSieve(limit, primes):
	mark = [False]*(limit+1)

	for i in range(2, limit+1):
		if not mark[i]:

			primes.append(i)
			for j in range(i, limit+1, i):
				mark[j] = True

def primesInRange(low, high):
    limit = floor(sqrt(high)) + 1
    primes = list()
    simpleSieve(limit, primes)
    n = high - low + 1
    mark = [False]*(n+1)
    for i in range(len(primes)):
        loLim = floor(low/primes[i]) * primes[i]
        if loLim < low:
            loLim += primes[i]
        if loLim == primes[i]:
            loLim += primes[i]

        for j in range(loLim, high+1, primes[i]):
            if j != primes[i]:
                mark[j-low] = True
    ans = []
    for i in range(low, high+1):
        if not mark[i-low]:
            ans.append(i)

    return ans


from collections import Counter,defaultdict
n = int(input())
arr = list(map(int,input().strip().split()))[:n]
maxi = max(arr)
store = Counter(arr)
temp = defaultdict(lambda :-1)
t = int(input())
for _ in range(t):
    res = 0
    low,high = map(int,input().split())
    ans  = primesInRange(low, high)

    for num in ans:
        if temp[num] == -1:
            i = 1;d = 0
            while num*i <= maxi:
                d += store[num*i]
                i+=1

            res += d
            temp[num] = d

        else:
            res += temp[num]


    print(res)
