#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    ll Q;
    cin >> Q;
    vector<ll> P(Q);
    vector<ll> L(Q);
    vector<ll> R(Q);
    rep(i, Q){
        cin >> P[i] >> L[i] >> R[i];
        L[i]--;
        R[i]--;
    }
    vector<ll> primes;
    for (ll i = 2; i <= 2000; i++){
        bool isprime = true;
        for (ll j = 2; j < i; j++){
            if (i % j == 0) isprime = false;
        }
        if (isprime) primes.push_back(i);
    }
    ll len = primes.size();
    vector<ll> zeros(N + 1, 0);
    vector<vector<ll>> sums(N + 1, vector<ll>(len, 0));
    for (ll i = 0; i < N; i++){
        if (A[i] == 0){
            zeros[i + 1]++;
            continue;
        }
        ll now_a = A[i];
        for (ll j = 0; j < len; j++){
            if (now_a < primes[j]) break;
            while (now_a % primes[j] == 0){
                sums[i + 1][j]++;
                now_a /= primes[j];
            }
        }
    }
    for (ll j = 0; j < len; j++){
        for (ll i = 0; i < N; i++){
            sums[i + 1][j] += sums[i][j];
        }
    }
    for (ll i = 0; i < N; i++){
        zeros[i + 1] += zeros[i];
    }
    
    for (ll i = 0; i < Q; i++){
        if (zeros[R[i] + 1] - zeros[L[i]] > 0){
            cout << "Yes" << endl;
            continue;
        }
        ll now_p = P[i];
        bool pos = true;
        for (ll j = 0; j < len; j++){
            if (now_p % primes[j] != 0) continue;
            if (now_p < primes[j]) break;
            ll div_cnt = 0;
            while (now_p % primes[j] == 0){
                div_cnt++;
                now_p /= primes[j];
            }
            if (div_cnt > sums[R[i] + 1][j] - sums[L[i]][j]){
                pos = false;
            }
        }
        if (now_p != 1){
            pos = false;
        }
        if (pos) cout << "Yes" << endl;
        else cout << "NO" << endl;
    }
}