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.
n=int(input())
arr=[int(x) for x in input().split()]
new=[0 for i in range(10000001)]
for ele in arr:
    new[ele]+=1
maxele=max(arr)
m=int(input())
q=[]
mini,maxi=float('inf'),0
for i in range(m):
    li=[int(x) for x in input().split()]
    mini=min(mini,li[0])
    if(li[1]>maxele):
        li[1]=maxele
    maxi=max(maxi,li[1])
    q.append(li)
count=[0 for i in range(10000000)]    
till=10000001
prime=[True for i in range(till)]
root=int(10000000**(0.5))

for i in range(2,root):
    if(prime[i]==True):
        if(new[i]>0):
            count[i]+=new[i]
        for j in range(i+i,till,i):
            if(new[j]>0):
                count[i]+=1
            prime[j]=False    
for i in range(1,len(count)):
    count[i]+=count[i-1]
d={}    
for ele in q:
    
    #start=min(ele[0],maxele)
    #end=min(ele[0],maxele)
    print(count[ele[1]]-count[ele[0]-1])
    
#for i in range(16):
 #   print(count[i],end=" ")