n = int(input())
A = list(map(int,input().split()))
q = int(input())
P = []
LR = []
for i in range(q):
    p,l,r = map(int,input().split())
    P.append(p)
    LR.append([l-1,r])


M = 2*10**3+5
count = [0]*M
primes = []
for i in range(2,M):
    if count[i]:
        continue
    primes.append(i)
    for j in range(i,M,i):
        count[j] += 1

accum = [0]*(n+1)
for p in primes:
    for i,a in enumerate(A,1):
        c = 0
        na = a
        while na%p == 0:
            na //= p
            c += 1
        accum[i] = accum[i-1]+c

    for i in range(q):
        l,r = LR[i]
        num = accum[r]-accum[l]
        while num and P[i]%p == 0:
            P[i] //= p
            num -= 1
for p in P:
    print("Yes" if p == 1 else "NO")