#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
vector<int> sieve(int n) {
  vector<int> primes;
  vector<bool> is_prime(n + 1, 1);
  is_prime[0] = 0;
  is_prime[1] = 0;
  for (int i = 2; i <= n; i++) {
    if (!is_prime[i]) continue;
    primes.push_back(i);
    for (int j = i + i; j <= n; j += i) {
      is_prime[j] = 0;
    }
  }
  return primes;
}
signed main() { 
  ios::sync_with_stdio(false); cin.tie(0);
  vector<int> primes = sieve(2005);
  int n;
  cin >> n;
  int m = (int) primes.size();
  vector<vector<int>> cnt(n + 1, vector<int>(m));
  vector<int> zero(n + 1);
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    for (int j = 0; j < m; j++) {
      int c = 0;
      while (a % primes[j] == 0) {
        a /= primes[j];
        c++;
      }
      cnt[i + 1][j] = cnt[i][j] + c;
    }
    zero[i + 1] = zero[i] + (a == 0);
  }
  int q;
  cin >> q;
  while (q--) {
    int p, l, r;
    cin >> p >> l >> r;
    if (zero[l] != zero[r]) {
      puts("Yes");
      continue;
    } 
    bool ok = true;
    for (int j = 0; j < m; j++) {
      int c = 0;
      while (p % primes[j] == 0) {
        p /= primes[j];
        c++;
      }
      ok &= (c <= cnt[r][j] - cnt[l - 1][j]);
    }
    ok &= (p == 1);
    puts(ok ? "Yes" : "NO");
  }
  return 0;
}