import sequtils,strutils,math,algorithm
var
    N = stdin.readline.parseInt
    zip : array[2005, int]
    unzip:array[304, int]
    A = stdin.readline.split.map(parseInt)
    primes = newSeq[int](0)
    isnotprime : array[2005, bool]
    S : array[350, array[-1..2005, int]]

for i in 2..2000:
    if isnotprime[i]:
        continue
    var j = i * 2
    while j <= 2000:
        isnotprime[j] = true
        j += i
    primes.add(i)
    
#echo primes.len(),primes
for i,p in primes:
    zip[p] = i
    unzip[i] = p
    
var
    Q = stdin.readline.parseInt
    P,L,R : int

for i,a in A:
    var k = a
    for j in primes:
        S[zip[j]][i] = S[zip[j]][i - 1]
        if a == 0:
            S[zip[j]][i] += 100
            continue
        while k mod j == 0:
            S[zip[j]][i] += 1
            k = k div j
    

for q in 0..<Q:
    (P, L, R) = stdin.readline.split.map(parseInt)
    L -= 2
    R -= 1
    var f : bool = true
    var s : array[304, int]
    for j in 0..303:
        s[j] = S[j][R] - S[j][L]
    for p in primes:
        while P mod p == 0:
            P = P div p
            s[zip[p]] -= 1
            if s[zip[p]] < 0:
                f = false
    if P > 1:
        f = false
    if f:
        echo "Yes"
    else:
        echo "NO"