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

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
VI prime;

void makePrime(){
  bool p[2001];
  memset(p,true,sizeof(p));
  p[0] = false;
  p[1] = false;
  for(int i = 2; i*i <=2000; i++){
    if(p[i] == false) continue;
    int x = 2;
    while(x*i<= 2000){p[x*i] = false; x++;}
  }
  rep(i,2001) if(p[i]) prime.push_back(i);

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

  makePrime();

  int n; cin >> n;
  VLL a(n);
  rep(i,n) cin >> a[i];

  ll mul[n][prime.size()];
  memset(mul,0,sizeof(mul));

  rep(i,n){
    if(i != 0){
      rep(j,prime.size()){
        mul[i][j] = mul[i-1][j];
        while(a[i] % prime[j] == 0) mul[i][j]++,a[i]/=prime[j];
      }
    }else{
      rep(j,prime.size()){
        while(a[i] % prime[j] == 0) mul[i][j]++,a[i]/=prime[j];
      }
    }
  }

  ll q; cin >> q;

  rep(i,q){
    ll p,l,r;
    cin >> p >> l >> r;
    l--,r--;
    bool flag = true;
    rep(j,prime.size()){
      int cnt = mul[r][j];
      if(l != 0) cnt -= mul[l-1][j];
      while(p % prime[j] == 0) cnt--, p/=prime[j];
      if(cnt < 0 )flag = false;
    }

    if(flag) cout << "Yes" << "\n";
    else cout << "NO" << "\n";
  }
  return 0;
}