#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<ll> operator+(const vector<ll>& a,const vector<ll>& b){
  vector<ll> res(a.size(),0);
  rep(i,a.size())res[i]=a[i]+b[i];
  return res;
}
vector<ll> operator-(const vector<ll>& a,const vector<ll>& b){
  vector<ll> res(a.size(),0);
  rep(i,a.size())res[i]=a[i]-b[i];
  return res;
}

bool isprime[2001];
vector<ll> ps;
ll M;
vector<ll> calcvec(ll X){
  if(X==0) return vector<ll>(M,0);

  vector<ll> res(M,0);
  rep(i,ps.size()){
    while(X%ps[i]==0){
      res[i]++;
      X/=ps[i];
    }
  }
  if(X!=1) return vector<ll>(1,-1);
  return res;
}

ll N,Q;
vector<ll> sum[100010];
ll zsum[100010];

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();

  sum[0]=vector<ll>(M,0);
  cin>>N;
  rep(i,N){
    ll A;
    cin>>A;
    if(A==0){
      zsum[i+1]=zsum[i]+1;
    }else{
      zsum[i+1]=zsum[i];
    }
    vector<ll> B=calcvec(A);
    sum[i+1]=sum[i]+B;
  }

  cin>>Q;
  rep(i,Q){
    ll P,L,R;
    cin>>P>>L>>R;
    L--;
    vector<ll> tmp=sum[R]-sum[L];
    vector<ll> p=calcvec(P);
    if(p[0]==-1){
      cout<<"NO"<<endl;
      continue;
    }
    bool ok=true;
    rep(j,M)if(tmp[j]<p[j])ok=false;
    if(ok||zsum[R]-zsum[L]>0) cout<<"Yes"<<endl;
    else cout<<"NO"<<endl;
  }

  return 0;
}