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.
import sys
input=sys.stdin.readline
from collections import defaultdict
import math 
def primeFactors(n):
    store,two=n,0
    while n % 2 == 0: 
        two=max(1,two)
        n = n / 2
        set_[store].add(2)
    l[2]+=two
    for i in range(3,int(math.sqrt(n))+1,2):
        more=0
        while n % i== 0:
            set_[store].add(int(i))
            more=max(1,more) 
            n = n / i
        l[int(i)]+=more
    if n > 2:
        set_[store].add(int(n))
        l[int(n)]+=1
    return(l)
l=[0]*(10000001)
n=int(input())
set_=defaultdict(set)
x=[int(i) for i in input().split() if i !='\n']
for k in (x):
    if k in set_:
        for jk in set_[k]:
            l[jk]+=1
    else:
        pq=primeFactors(k)
for j in range(1,len(l)):
    l[j]=l[j]+l[j-1]
#print(l)
m=int(input())
for j in range(m):
    l1,r=map(int,input().split())
    print(l[r]-l[l1-1])
    
    
