from itertools import chain, accumulate
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
U = 2000
U = 100


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return primes


prime = sorted(prime_set(U))
N = int(input())
A = list(map(int, input().split()))

memo = [[0] * (N + 1) for _ in range(len(prime) + 1)]
for i, a in enumerate(A, 1):
    if a == 0:
        memo[0][i] = 1
memo[0] = tuple(accumulate(memo[0]))
for i, p in enumerate(prime, 1):
    for j, a in enumerate(A, 1):
        while a % p == 0:
            memo[i][j] += 1
            a //= p
    memo[i] = tuple(accumulate(memo[i]))

Q = int(input())
ans = []
for _ in range(Q):
    X, S, T = map(int, input().split())
    S -= 1
    ok = (memo[0][T] - memo[0][S] == 0)
    for i, p in enumerate(prime, 1):
        cnt = 0
        while X % p == 0:
            cnt += 1
            X //= p
        ok &= memo[i][T] - memo[i][S] >= cnt
    if ok and X == 1:
        ans.append("Yes")
    else:
        ans.append("NO")

if ans:
    print("\n".join(ans))