#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

vector<int> operator+(const vector<int>& a,const vector<int>& b){
  vector<int> res(a.size(),0);
  rep(i,a.size())res[i]=a[i]+b[i];
  return res;
}

bool isprime[2001];
vector<int> ps;
int M;
vector<int> calcvec(int X){
  vector<int> res(M,0);
  rep(i,ps.size()){
    while(X%ps[i]==0){
      res[i]++;
      X/=ps[i];
    }
  }
  return res;
}

struct RangeSumQuery{
  vector<int> dat[(1<<18)-1];
  int size;

  void init(int n_){
    size=1;
    while(size<n_) size*=2;
    for(int i=0;i<2*size-1;i++)dat[i]=vector<int>(M,0);
  }

  void update(int k,vector<int> a){
    k+=size-1;
    dat[k]=a;
    while(k>0){
      k=(k-1)/2;
      dat[k]=dat[k*2+1]+dat[k*2+2];
    }
  }

  vector<int> subquery(int a,int b,int k,int l,int r){
    if(r<=a||b<=l)return vector<int>(M,0);
    if(a<=l&&r<=b)return dat[k];
    else{
      return subquery(a,b,k*2+1,l,(l+r)/2)+subquery(a,b,k*2+2,(l+r)/2,r);
    }
  }
  
  vector<int> query(int a,int b){
    return subquery(a,b,0,0,size);
  }
};

int N,Q;
RangeSumQuery sgt;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  repl(i,2,2001)isprime[i]=true;
  for(ll i=2;i<=2000;i++){
    if(isprime[i]){
      ps.push_back(i);
      for(ll j=i*2;j<=2000;j+=i)isprime[j]=false;
    }
  }
  M=ps.size();

  cin>>N;
  sgt.init(N);
  rep(i,N){
    int A;
    cin>>A;
    vector<int> B=calcvec(A);
    sgt.update(i,B);
  }

  cin>>Q;
  rep(i,Q){
    int P,L,R;
    cin>>P>>L>>R;
    L--;
    vector<int> tmp=sgt.query(L,R);
    vector<int> p=calcvec(P);
    bool ok=true;
    rep(j,M)if(tmp[j]<p[j])ok=false;
    if(ok) cout<<"Yes"<<endl;
    else cout<<"NO"<<endl;
  }

  return 0;
}