#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<chrono>
#include<random>
#include<cctype>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(decltype(n) i=0; i<(n); i++)
#define rrep(i,n) for(decltype(n) i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(decltype(a) i=(a); i<(b); i++)
#define RFOR(i,a,b) for(decltype(b) i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"NO") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

struct factorizer{
    vector<bool> isprime;
    vector<ll> primes;
    factorizer(ll n) : isprime(sqrtl(n)+1,true){
        isprime[1] = false;
        for(ll i = 2; i*i <= n; i++){
            if(!isprime[i]) continue;
            primes.pb(i);
            for(ll j = i+i; j*j <=n; j += i){
                isprime[j] = false;
            }
        }
    }

    vector<pair<ll,int>> factorize(ll n){
        vector<pair<ll,int>> res;
        for(ll p : primes){
            if(p * p > n) break;
            int e = 0;
            while(n%p == 0){
                n /= p;
                e++;
            }
            if(e > 0) res.pb({p,e});
        }
        if(n > 1) res.pb({n,1});
        return res;
    }

    vector<ll> divisors(ll n){
        vector<ll> res({1});
        const auto& pf = factorize(n);
        for(auto p : pf){
            for(ll x : res){
                ll v = 1;
                rep(j,p.second){
                    v *= p.first;
                    res.pb(x * v);
                }
            }
        }
        return res;
    }
};

int cs[100001][303];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    vector<int> a(n); in(a);
    factorizer f(1e9+1);
    vector<int> pr(2001,-1);
    int cnt = 0;
    FOR(i,1,2001){
        if(f.isprime[i]) pr[i] = cnt++;
    }
    rep(i,n+1)rep(j,cnt) cs[i][j] = 0;
    vector<int> zeros(n+1);
    rep(i,n){
        if(a[i]){
            auto v = f.factorize(a[i]);
            for (auto& [p,e] : v){
                cs[i+1][pr[p]] += e;
            }
        }
        else{
            zeros[i+1] = zeros[i]+1;
        }
        rep(j,cnt) cs[i+1][j] += cs[i][j];
    }
    int q; in(q);
    while(q--){
        int x,l,r; in(x,l,r); l--;
        if(zeros[r]-zeros[l] > 0){
            out("Yes");
            continue;
        }
        auto v = f.factorize(x);
        int ok = 1;
        for(auto& [p,e] : v){
            if(p > 2000){
                ok = 0;
                break;
            }
            else{
                int idx = pr[p];
                if(cs[r][idx]-cs[l][idx] < e){
                    ok = 0;
                    break;
                }
            }
        }
        yesno(ok);
    }
}