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.
MAX_X = 10**7 + 1

def sieve_of_eratosthenes(n):
    is_prime = [True] * (n + 1)
    p = 2
    while p**2 <= n:
        if is_prime[p]:
            for i in range(p**2, n + 1, p):
                is_prime[i] = False
        p += 1
    primes = [i for i, prime in enumerate(is_prime) if prime and i > 1]
    return primes

primes = sieve_of_eratosthenes(MAX_X)

n = int(input())
numbers = list(map(int, input().split()))

count_divisible = [0] * (MAX_X)

for num in numbers:
    for prime in primes:
        if prime * prime > num:
            break
        if num % prime == 0:
            count_divisible[prime] += 1
            while num % prime == 0:
                num //= prime
    if num > 1:
        count_divisible[num] += 1

cumulative = [0] + list(count_divisible)
for i in range(1, len(cumulative)):
    cumulative[i] += cumulative[i-1]

m = int(input())
for _ in range(m):
    l, r = map(int, input().split())
    r = min(r, MAX_X - 1)
    l = min(l, MAX_X - 1)
    print(cumulative[r] - cumulative[l - 1])
