#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

map< int64_t, int > prime_factor(int64_t n) {
  map< int64_t, int > ret;
  for(int64_t i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return (ret);
}

int64_t mod_pow(int64_t x, int64_t n, int64_t mod) {
  int64_t ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}

int main() {
  int N;
  cin >> N;
  vector< int64 > A(N);
  cin >> A;

  vector< int > id(202020, -1);
  int ptr = 0;
  vector< vector< int > > sum;
  vector< int > uku;

  for(int i = 0; i < N; i++) {
    auto p = prime_factor(A[i]);
    for(auto &t : p) {
      if(id[t.first] == -1) {
        id[t.first] = ptr++;
        uku.emplace_back(t.first);
        sum.emplace_back(A.size() + 1);
      }
      sum[id[t.first]][i + 1] += t.second;
    }
  }
  for(auto &vs : sum) {
    for(int i = 1; i < vs.size(); i++) vs[i] += vs[i - 1];
  }


  int Q;
  cin >> Q;
  vector< int > look(2001, -1);
  vector< int > cnt(2001, -1);

  for(int i = 0; i < Q; i++) {
    int p, l, r;
    cin >> p >> l >> r;
    --l;
    if(p == 1) {
      cout << "Yes" << endl;
      continue;
    }

    auto k = prime_factor(p);

    bool f = true;
    for(auto &p : k) {
      if(p.first <= 2000) {
        if(id[p.first] == -1) {
          f = false;
        }
        look[p.first] = i;
        cnt[p.first] = p.second;
      }
    }
    for(int j = 0; j < sum.size(); j++) {
      int sz = sum[j][r] - sum[j][l];
      if(sz == 0) continue;
      if(look[uku[j]] == i) {
        f &= sz >= cnt[uku[j]];
      } else {
      }
    }
    if(!f) cout << "Yes" << endl;
    else cout << "NO" << endl;
  }
}