#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PL;
typedef pair<int,int> P;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

vector<int> sieve(int n) {
    vector<bool> prime(n + 1,true);
    prime[0] = false;
    prime[1] = false;
    for (int i = 3; i * i <= n; i += 2) {
        if (prime[i]) {
            int j = 2;
            while (i * j <= n) {
                prime[i * j] = false;
                j ++;
            }
        }
    }
    vector<int> ans = {2};
    for (int i = 3; i < n + 1; i += 2) {
        if (prime[i]) ans.push_back(i);
    }
    return ans; 
}

vector<int> factorization(int N,vector<int>& primes) {
    vector<int> ans(primes.size(),0);
    for (int i = 0;i < primes.size();i ++) {
        while (N%primes[i] == 0) {
            N /= primes[i]; ans[i] ++;
        }
    }
    if (N > 1) {
        primes.push_back(N);
        ans.push_back(1);
    }
    return ans;
}

int main() {
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];

    vector<int> primes = sieve(60);
    vector<vector<int>> fact(N + 1);
    rep(i,N) fact[i + 1] = factorization(A[i],primes);
    rep(i,N)rep(j,primes.size()) {
        if (j >= fact[i].size()) fact[i].push_back(0);
        if (j >= fact[i + 1].size()) fact[i + 1].push_back(0);
        fact[i + 1][j] += fact[i][j];
    }
    
    int Q; cin >> Q;
    rep(i,Q) {
        int P,L,R; cin >> P >> L >> R;
        rep(j,primes.size()) {
            int divisor = fact[R][j] - fact[L - 1][j];
            while (P%primes[j] == 0 && divisor > 0) {
                P /= primes[j];
                divisor --;
            }
            if (P%primes[j] == 0) break;
        }
        if (P > 1) cout << "NO" << endl;
        else cout << "Yes" << endl;
    }
    return 0;
}