#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
const long long MOD = 1e9+7, INF = 1e18;
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a=b;return true;}return false;}

vector<int> P;
void make_primes(int n)
{
	vector<bool> primes;
	n++;
	primes.resize(n, true);
	primes[0] = primes[1] = false;
	FOR(i, 2, sqrt(n)) if (primes[i]) for (int j = 0; i * (j + 2) < n; j++)
		primes[i * (j + 2)] = false;

	FOR(i, 2, n) if (primes[i]) P.push_back(i);
}

vector<pair<long long, long long> > prime_factorize(long long n) {
    //計算量は√N!!!
    vector<pair<long long, long long> > res;
    for (long long p = 2; p * p <= n; ++p) {
        if (n % p != 0) continue;
        int num = 0;
        while (n % p == 0) { ++num; n /= p; }
        res.push_back(make_pair(p, num));
    }
    if (n != 1) res.push_back(make_pair(n, 1));
    return res;
}

signed main(){
	int N;
	cin >> N;
	make_primes(2000);
	vector<int>inv(2000,0);
	REP(i,P.size())inv[P[i]] = i;
	vector<int> a(N); for(auto& e:a)cin >> e;
	vector<vector<int>>cnt(N+1,vector<int>(P.size(),0));
	REP(i,N){
		auto tmp = prime_factorize(a[i]);
		for(auto e:tmp){
			cnt[i+1][inv[e.first]] += e.second;
		}
	}
	REP(i,N)REP(j,P.size())cnt[i+1][j] += cnt[i][j];
	int Q;
	cin >> Q;
	vector<vector<int>>query;
	vector<int>l(Q),r(Q);
	vector<int>ans(Q);
	REP(i,Q){
		int p;
		cin >> p >> l[i] >> r[i];
		l[i]--;r[i]--;
		vector<int>tmp(P.size(),0);
		REP(j,P.size()){
			while(p%P[j] == 0){
				p /= P[j];
				tmp[inv[P[j]]]++;
			}
		}
		if(p != 1)ans[i] = 1;
		query.push_back(tmp);
	}
	REP(i,Q){
		if(ans[i])continue;
		int flg = 0;
		REP(j,P.size()){
			if(query[i][j]>cnt[r[i]+1][j]-cnt[l[i]][j]){
				flg = 1;
				break;
			}
		}
		ans[i]=flg;
	}
	for(auto e:ans){
		if(e)cout<<"NO"<<endl;
		else cout<<"Yes"<<endl;
	}
}