#ifdef DEBUG_IS_VALID
#define DEB 1 
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif

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

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#define fi first
#define se second
#pragma GCC optimize ("-O3")

using namespace std;

#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}
void solve();
int main(void) {
  std::cout << std::fixed << std::setprecision(15);
  solve();
	return 0;
}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<Pl>;
using vvp = vector<vp>;

const int INF = 1<<29;
const long long LINF=1LL<<59;

vector<ll> primes(ll n) {
  // O(n loglog(n))
  // res: sz ~ O(n/log(n))
  vector<bool> is_prime(n+1,true);
  is_prime[0] = is_prime[1] = false;
  vector<ll> res;
  for(ll i = 2; i <= n; i++){
    if(!is_prime[i]) continue;
    for(ll j = 2; j*i <= n; j++) is_prime[j*i] = false;
    res.push_back(i);
  }
  return res;
}
unordered_map<int,int> mp; // key: prime, val: index
ll sz = 0;

vi enumpr(ll n) {
  // assert(sz != 0);
  vector<int> vec(sz);
  for (ll i = 2; 1LL * i*i <= n; i++) while (n%i == 0) vec[mp[i]]++, n /= i;
  if (n>1) vec[mp[n]]++;
  return vec;
}

void solve(){
  ll N;
  cin >> N ;
  vl a(N);
  rep(i,N) cin >> a[i] ;
  auto pr = primes(*max_element(ALL(a)));
  sz = pr.size();
  rep(i,pr.size()) mp[pr[i]] = i;
  vvi x(N);
  vvi s(N+1,vi(sz));
  rep(i,N) x[i] = enumpr(a[i]);
  rep(i,N){
    rep(j,sz) s[i+1][j] = s[i][j] + x[i][j];
  }
  dump(x);
  dump(s);
  int Q;
  cin >> Q ;
  rep(i,Q){
    ll p; int l,r;
    cin >> p >> l >> r ;
    l--; r--;
    vi vec(sz);
    rep(j,sz) vec[j] = s[r+1][j] - s[l][j];
    rep(j,sz){
      while(vec[j]>0){
        vec[j]--;
        if(p%pr[j]==0) p /= pr[j];
        if(p==1) break;
      }
      if(p==1) break;
    }
    cout << (p==1 ? "Yes" : "No") << endl;
  }
}