#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
int N,Q;
const int M = 2000;
int S[304][1 << 17];
void solve()
{
	vector<int> P;
	for(int i = 2;i <= M;i++)
	{
		bool p = true;
		for(int j = 2;j*j <= i;j++) if(i%j == 0) p = false;
		if(p) P.push_back(i);
	}
	const int L = (int)P.size();
	cin >> N;
	for(int i = 0;i < N;i++)
	{
		int A;
		cin >> A;
		S[0][i+1] = S[0][i] + (A == 0);
		for(int j = 1;j <= L;j++)
		{
			int e = 0;
			while(A != 0 && A%P[j-1] == 0) A /= P[j-1],e++;
			S[j][i+1] = S[j][i]+e;
		}
	}
	cin >> Q;
	for(;Q--;)
	{
		int x,l,r;
		cin >> x >> l >> r;
		l--;
		if(S[0][r]-S[0][l] > 0)
		{
			cout << "Yes\n";
			continue;
		}
		bool ok = true;
		for(int i = 1;i <= L;i++)
		{
			int e = 0;
			while(x%P[i-1] == 0) x /= P[i-1],e++;
			ok &= (e <= (S[i][r]-S[i][l]));
		}
		ok &= x == 1;
		cout << (ok ? "Yes\n":"NO\n");
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}