#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int arr[N], b[N], pre[N];
int primes[1000010], tot, f[1000010];
bool check[1000010];
int old[1000010];
int a[N];
int n;
long long qmi(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
struct node {
  int l, r, id;
};
node qry[N];
int ans[N];
bool cmp(node a, node b) { return a.r < b.r; }
inline long long inv(int x) { return qmi(x, mod - 2); }
inline int lowbit(int x) { return x & -x; }
inline void add(int x, int d) {
  for (int i = x; i <= n; i += lowbit(i)) {
    b[i] = 1ll * b[i] * d % mod;
  }
}
inline int query(int x) {
  long long ans = 1;
  for (int i = x; i; i -= lowbit(i)) {
    ans = ans * b[i] % mod;
  }
  return ans;
}
inline void update(int x) {
  int val = arr[x];
  for (int p = f[val]; p > 1; p = f[val]) {
    add(x, p - 1), add(x, inv(p));
    if (old[p]) add(old[p], inv(p - 1)), add(old[p], p);
    old[p] = x;
    while (val % p == 0) val /= p;
  }
}
void init(int n) {
  for (int i = 2; i <= n; i++) {
    if (!check[i]) {
      primes[++tot] = i;
      f[i] = i;
    }
    for (int j = 1; primes[j] * i <= n; j++) {
      check[primes[j] * i] = true;
      if (i % primes[j] == 0) {
        f[primes[j] * i] = f[i];
        break;
      }
      f[primes[j] * i] = primes[j];
    }
  }
}
int main() {
  cin >> n;
  init(1000000);
  pre[0] = 1;
  for (int i = 0; i <= n; i++) b[i] = 1;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    pre[i] = 1ll * arr[i] * pre[i - 1] % mod;
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    cin >> qry[i].l >> qry[i].r;
    qry[i].id = i;
  }
  sort(qry + 1, qry + q + 1, cmp);
  int now = 1;
  for (int i = 1; i <= q; i++) {
    while (now <= qry[i].r) {
      update(now);
      now++;
    }
    int l = qry[i].l, r = qry[i].r;
    ans[qry[i].id] = 1ll * pre[r] * inv(pre[l - 1]) % mod * query(r) % mod *
                     inv(query(l - 1)) % mod;
  }
  for (int i = 1; i <= q; i++) cout << ans[i] << endl;
}
