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

int main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  int maxa = *max_element(A.begin(), A.end());

  vector<int> zps; // zero positions
  for (int i = 0; i < N; ++i) {
    if (A[i] == 0) zps.push_back(i);
  }

  vector<int> apf; // any prime factor
  vector<int> prs;
  vector<int> pfx; {
    apf.resize(maxa + 1);
    iota(apf.begin(), apf.end(), 0);
    for (int i = 2; i < maxa + 1; ++i) {
      if (apf[i] != i) continue; // not prime
      prs.push_back(i);
      for (int j = i; j < maxa + 1; j += i) {
        apf[j] = i;
      }
    }
    pfx.resize(maxa + 1);
    for (int i = 0; i < prs.size(); ++i) {
      pfx[prs[i]] = i;
    }
  }

  vector<vector<int>> ap(N + 1, vector<int>(prs.size())); {
    for (int i = 0; i < N; ++i) {
      ap[i + 1] = ap[i];
      int v = A[i];
      while (1 < v) {
        ++ap[i + 1][pfx[apf[v]]];
        v /= apf[v];
      }
    }
  }

  int Q;
  cin >> Q;

  for (int qi = 0; qi < Q; ++qi) {
    int P, L, R;
    cin >> P >> L >> R;
    int zp = lower_bound(zps.begin(), zps.end(), L - 1) - zps.begin();
    if (zp < zps.size() && zps[zp] < R) {
      cout << "Yes" << endl;
    } else {
      bool ok = true;
      for (int p : prs) {
        if (P % p) continue;
        int c = 0;
        for (; P % p == 0; ++c) P /= p;
        if (ap[R][pfx[p]] - ap[L - 1][pfx[p]] < c) {
          ok = false;
          break;
        }
      }
      ok &= P == 1;
      cout << (ok ? "Yes" : "NO") << endl;
    }
  }

  return 0;
}