#include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma region using namespace std; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define rep(i,n) FOR(i,0LL,n) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define rrep(i,n) RFOR(i,0LL,n) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x) #define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end()) #define pb push_back typedef long long int ll; typedef vector vll; typedef vector vvll; typedef pair pll; typedef vector vpll; typedef vector vs; typedef map MAP; const ll inf = 1LL << 61; const ll mod = 1000000007LL; //const ll mod = 998244353LL; ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf; string s; ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 }; #define endl '\n' #pragma endregion #define MAX 222222 ll sum[MAX / 2][333], a[MAX / 2]; vll pr; bool is[MAX + 1]; void AllPrime(ll x) { rep(i, x + 1) is[i] = true; is[0] = false; is[1] = false; rep(i, x + 1) { if (is[i]) { pr.pb(i); for (ll j = 2 * i; j <= x; j += i) is[j] = false; } } } vpll factorize(ll val) { vpll ret; for (ll i = 2; i*i <= val; i++) { if (!(val%i)) { ll fcnt = 0; while (!(val%i)) { val /= i; fcnt++; } ret.pb(make_pair(i, fcnt)); } } if (val != 1) ret.pb(make_pair(val, 1)); return ret; } int main(void) { ios::sync_with_stdio(false); cin.tie(0); AllPrime(4000); unordered_map idx; cin >> n; FOR(i, 1, n + 1) cin >> a[i]; rep(i, pr.size()) idx[pr[i]] = i; FOR(i, 1, n + 1) { vpll v = factorize(a[i]); rep(j, v.size()) { sum[i][idx[v[j].first]] += v[j].second; } } rep(i, n) { rep(j, pr.size()) { sum[i + 1][j] += sum[i][j]; } } cin >> m; while (m--) { ll p, le, ri; cin >> p >> le >> ri; bool ok = true; rep(i, pr.size()) { ll num = 0; while (p%pr[i] == 0) { num++; p /= pr[i]; } if (sum[ri][i] - sum[le - 1][i] < num) ok = false; } if (ok&&p == 1) cout << "Yes" << endl; else cout << "NO" << endl; } return 0; }