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


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


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


for p in range(U):
    if is_prime[p]:
        solve(p)
for i in range(Q):
    if P[i] > 1:
        ok[i] = 0

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