#!/usr/bin/env python3.8
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

INF = 100

N = int(readline())
A = list(map(int, readline().split()))
Q = int(readline())
m = map(int, read().split())
P, L, R = zip(*zip(m, m, m))
P = list(P)


U = 2010
is_prime = [1] * U
is_prime[0] = 0
is_prime[1] = 0
for p in range(2, U):
    if p * p >= U:
        break
    for i in range(p * p, U, p):
        is_prime[i] = 0

ok = [1] * Q
ord_A = [0] * (N + 1)


def solve(p):
    for i in range(N):
        e = 0
        if A[i]:
            while A[i] % p == 0:
                A[i] //= p
                e += 1
        ord_A[i + 1] = ord_A[i] + e
    for i in range(Q):
        e = 0
        while P[i] % p == 0:
            P[i] //= p
            e += 1
        f = ord_A[R[i]] - ord_A[L[i] - 1]
        if f < e:
            ok[i] = 0


for p in range(U):
    if is_prime[p]:
        solve(p)

zero_cnt = [0] * (N + 1)
for i, x in enumerate(A):
    zero_cnt[i + 1] = zero_cnt[i] + (x == 0)

for i in range(Q):
    if P[i] > 1:
        ok[i] = 0
    if zero_cnt[R[i]] - zero_cnt[L[i] - 1]:
        ok[i] = 1

answers = ('Yes' if x else 'NO' for x in ok)
print('\n'.join(answers))