#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

vector<int> sieve(int n) {
    vector<bool> f(n + 1);
    for (int i = 3; i <= n; i += 2) f[i] = 1;
    for (int i = 3; i <= sqrt(n); i += 2) if (f[i]) for (int j = i * 3; j <= n; j += i) f[j] = 0;
    vector<int> res;
    if (n >= 2)res.push_back(2);
    for (int i = 3; i <= n; i += 2) if (f[i]) res.push_back(i);
    return res;
}

void solve() {
    vi primes = sieve(2000); // 303個

    int N;
    cin >> N;
    vi A(N);
    rep(i, N)cin >> A[i];

    int Q;
    cin >> Q;
    vi P(Q), L(Q), R(Q);
    vector<bool> ans(Q);

    rep(i, Q) {
        cin >> P[i] >> L[i] >> R[i];
        --L[i];
    }

    vi x(N + 1);
    rep(i, N) {
        if (A[i] == 0)x[i + 1]++;
        x[i + 1] += x[i];
    }
    rep(i, Q)if ( x[R[i]]-x[L[i]] > 0) {
        ans[i] = true;
    }

    each(prime, primes) {
        fill(all(x), 0);
        rep(i, N) {
            if (A[i] == 0)continue;
            int cnt = 0;
            while (A[i] % prime == 0) {
                cnt++;
                A[i] /= prime;
            }
            x[i + 1] = x[i] + cnt;
        }

        rep(i, Q) {
            int y = x[R[i]] - x[L[i]];
            for (int j = 0; j < y && P[i] % prime == 0; ++j) {
                P[i] /= prime;
            }
            if (P[i] == 1) {
                ans[i] = true;
            }
        }
    }
    
    rep(i, Q) {
        cout << (ans[i] ? "Yes" : "NO") << endl;
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}