#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

const int mn = 2001;
bool isp[mn];
vector<int> c[mn];
vector<int> p;
void init() {
	fill(isp + 2, isp + mn,true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		p.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
	rep1(i, mn - 1) {
		c[i].resize(p.size());
		int cop = i;
		rep(j, p.size()) {
			int cnt = 0;
			while (cop%p[j] == 0) {
				cop /= p[j]; cnt++;
			}
			c[i][j] = cnt;
		}
	}
	c[0].resize(p.size(),30);
}

vec r[1 << 17];

void solve() {
	r[0].resize(p.size(), 0);
	int n, q; cin >> n;
	vector<int> zer;
	rep(i, n) {
		int a; cin >> a;
		if (a == 0) {
			zer.push_back(i);
		}
		r[i + 1] = r[i];
		rep(j, p.size()) {
			r[i + 1][j] += c[a][j];
		}
	}
	cin >> q;
	rep(i, q) {
		int a, le, ri; cin >> a >> le >> ri;
		le--; ri--;
		{
			int num = upper_bound(zer.begin(), zer.end(), ri) - lower_bound(zer.begin(), zer.end(),le);
			if (num > 0) {
				cout << "Yes" << endl; continue;
			}
		}
		rep(j, p.size()) {
			int num = r[ri + 1][j] - r[le][j];
			rep(k, num) {
				if (a%p[j])break;
				a /= p[j];
			}
		}
		if (a == 1) {
			cout << "Yes" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	init();
	solve();
	//cout << "finish" << endl;
	//stop
	return 0;
}