#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
bool is_prime(long long val) {
  if (val <= 1) return false;
  for (long long i = 2; i * i <= val; ++i) {
    if (val % i == 0) return false;
  }
  return true;
}

vector<pair<long long, int> > prime_factorization(long long val) {
  vector<pair<long long, int> > res;
  for (long long i = 2; i * i <= val; ++i) {
    if (val % i != 0) continue;
    int exponent = 0;
    while (val % i == 0) {
      ++exponent;
      val /= i;
    }
    res.emplace_back(i, exponent);
  }
  if (val != 1) res.emplace_back(val, 1);
  return res;
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n; cin >> n;
  vector<int> primes;
  FOR(i, 1, 2001) {
    if (is_prime(i)) primes.emplace_back(i);
  }
  int sz = primes.size();
  map<int, int> mp;
  REP(i, sz) mp[primes[i]] = i;
  vector<vector<int> > a(sz, vector<int>(n + 1, 0));
  REP(i, n) {
    REP(j, sz) a[j][i + 1] = a[j][i];
    int ai; cin >> ai;
    auto p = prime_factorization(ai);
    for (auto pr : p) {
      a[mp[pr.first]][i + 1] += pr.second;
    }
  }
  int q; cin >> q;
  while (q--) {
    int p, l, r; cin >> p >> l >> r; --l; --r;
    vector<int> range(sz, 0);
    REP(i, sz) range[i] = a[i][r + 1] - a[i][l];
    auto factor = prime_factorization(p);
    bool ok = true;
    for (auto pr : factor) {
      if (pr.first > 2000) {
        ok = false;
        break;
      }
      if (range[mp[pr.first]] < pr.second) {
        ok = false;
        break;
      }
    }
    cout << (ok ? "Yes\n" : "NO\n");
  }
  return 0;
}