#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);
}

signed main(){
	int N;
	cin >> N;
	make_primes(2000);
	vector<int> a(N); for(auto& e:a)cin >> e;
	vector<vector<int>>cnt(N+1,vector<int>(P.size(),0));
	vector<int>zero(N+1,0);
	REP(i,N){
		if(a[i] == 0)zero[i+1]++;
		REP(j,P.size()){
			while(a[i] != 0 && a[i]%P[j] == 0){
				a[i] /= P[j];
				cnt[i+1][j]++;
			}
		}
	}
	REP(i,N)zero[i+1] += zero[i];
	REP(i,N)REP(j,P.size())cnt[i+1][j] += cnt[i][j];
	int Q;
	cin >> Q;
	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]--;
		if(zero[r[i]+1]-zero[l[i]]){
			ans[i] = 0;continue;
		}
		vector<int>tmp(P.size(),0);
		REP(j,P.size()){
			while(p%P[j] == 0){
				p /= P[j];
				tmp[j]++;
			}
		}
		if(p > 1){
			ans[i] = 1;
			continue;
		}
		int flg = 0;
		REP(j,P.size()){
			if(tmp[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;
	}
}