#include <bits/stdc++.h>

using namespace std;

bool isprime(long long n) {
  if (n < 2) return false;
  if (n == 2) return true;
  if (n % 2 == 0) return false;
  
  for (long long i = 3; i * i <= n; i += 2)
    if (n % i == 0)
      return false;
  
  return true;
}

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

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> zeros(n + 1);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    zeros[i+1] = zeros[i] + (a[i] == 0);
  }
  
  vector<vector<int> > factors;
  vector<int> primes;
  
  for (int p = 0; p < 2000; p++) {
    if (isprime(p)) {
      primes.push_back(p);
      vector<int> f(n+1);
      for (int i = 0; i < n; i++) {
        int b = a[i];
        f[i+1] += f[i];
        while (b > 0 && b % p == 0) {
          b /= p;
          ++f[i+1];
        }

      }
      factors.push_back(f);
    }
  }

  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x, l, r;
    cin >> x >> l >> r;
    bool ck = true;
    for (int j = 0; j < primes.size(); j++) {
      int c = 0;
      while (x % primes[j] == 0) {
        x /= primes[j];
        ++c;
      }
      if (c > factors[j][r] - factors[j][l-1]) {
        ck = false;
        break;
      }
    }
    cout << x << endl;
    ck &= x == 1;
    ck |= zeros[r] - zeros[l-1] > 0;
    if (ck)
      cout << "Yes" << endl;
    else
      cout << "NO" << endl;
  }
  
  return 0;
}