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.
# 2022-10-03 15:41:22.214307
# https://codeforces.com/problemset/problem/385/C
import math
import sys
from collections import Counter

input = sys.stdin.readline

n = int(input())
a = list(map(int, input().split()))
m = int(input())
c = Counter(a)

# calc primes in [2, 10 ** 7]
_MAX_V = min(max(a), 10 ** 7) + 1

primes = [True] * _MAX_V
pre = [0] * _MAX_V
_LIMIT = int(math.sqrt(_MAX_V)) + 1

# for e in a:
#     pre[e] += 1

for i in range(2, _MAX_V):
    if not primes[i]:
        continue
    # pre[i] += c[i]
    for j in range(i, _MAX_V, i):
        primes[j] = False
        pre[i] += c[j]

for i in range(2, _MAX_V):
    pre[i] += pre[i - 1]

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