import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

class Sieve:
    def __init__(self, n):
        self.plist = [2]  # n以下の素数のリスト
        min_prime_factor = [2, 0]*(n//2+5)
        for x in range(3, n+1, 2):
            if min_prime_factor[x] == 0:
                min_prime_factor[x] = x
                self.plist.append(x)
                if x**2 > n: continue
                for y in range(x**2, n+5, 2*x):
                    if min_prime_factor[y] == 0:
                        min_prime_factor[y] = x
        self.min_prime_factor = min_prime_factor

    def isprime(self, x):
        return self.min_prime_factor[x] == x

    # これが素因数分解(prime factorization)
    def pfct(self, x):
        pp, ee = [], []
        while x > 1:
            mpf = self.min_prime_factor[x]
            if pp and mpf == pp[-1]:
                ee[-1] += 1
            else:
                pp.append(mpf)
                ee.append(1)
            x //= mpf
        return [(p, e) for p, e in zip(pp, ee)]

from collections import defaultdict

sv = Sieve(2005)
n = II()
aa = LI()
df = lambda: [0]*(n+1)
cs = defaultdict(df)

for i, a in enumerate(aa):
    if a == 0:
        cs[0][i+1] = 1
    else:
        pe = sv.pfct(a)
        for p, e in pe: cs[p][i+1] = e

for k, v in cs.items():
    for i in range(n): v[i+1] += v[i]
# print(cs)

def ok(a):
    if a == 1: return True
    if cs[0][r]-cs[0][l]: return True
    for p in cs.keys():
        if p == 0: continue
        e = 0
        while a%p == 0:
            a //= p
            e += 1
        if e and cs[p][r]-cs[p][l] < e: return False
    if a != 1: return False
    return True

for _ in range(II()):
    a, l, r = MI()
    l -= 1
    print("Yes" if ok(a) else "NO")