#include <bits/stdc++.h>
using namespace std;
vector<int> pos[1001000];
vector<int> pf[1001000];
int lpf[1001000], prm[1001000], inv[1001000], pcnt;
int ans[200100], a[200100], f[200100];
bool notp[1001000];
struct qry {
  int l, r, id;
  bool operator<(const qry& o) const { return l < o.l; }
} qq[200100];
int cal_inv(int x) {
  int y = 1000000007 - 2, r = 1;
  while (y) {
    if (y & 1) r = 1LL * r * x % 1000000007;
    x = 1LL * x * x % 1000000007;
    y >>= 1;
  }
  return r;
}
void upd(int x, int v) {
  while (x < 200100) {
    f[x] = 1LL * v * f[x] % 1000000007;
    x += x & -x;
  }
}
int mul(int x) {
  int r = 1;
  while (x) {
    r = 1LL * r * f[x] % 1000000007;
    x -= x & -x;
  }
  return r;
}
int main() {
  for (int i = 2; i < 1001000; i++) {
    if (!notp[i]) prm[pcnt++] = i, lpf[i] = i;
    for (int j = 0; j < pcnt && i * prm[j] < 1001000; j++) {
      notp[i * prm[j]] = true;
      lpf[i * prm[j]] = prm[j];
      if (i % prm[j] == 0) break;
    }
  }
  for (int i = 1; i < 1001000; i++) {
    inv[i] = cal_inv(i);
  }
  for (int i = 1; i < 200100; i++) f[i] = 1;
  int n, q, now = 1;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    upd(i, a[i]);
  }
  for (int i = n; i >= 1; i--) {
    while (a[i] > 1) {
      int p = lpf[a[i]];
      pf[i].push_back(p);
      pos[p].push_back(i);
      while (a[i] % p == 0) a[i] /= p;
    }
  }
  for (int i = 0; i < pcnt; i++) {
    if (!pos[prm[i]].empty()) {
      upd(pos[prm[i]].back(), 1LL * inv[prm[i]] * (prm[i] - 1) % 1000000007);
    }
  }
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    scanf("%d%d", &qq[i].l, &qq[i].r);
    qq[i].id = i;
  }
  sort(qq, qq + q);
  for (int i = 0; i < q; i++) {
    while (now < qq[i].l) {
      upd(now, inv[f[now]]);
      for (int j = 0; j < pf[now].size(); j++) {
        int p = pf[now][j];
        pos[p].pop_back();
        if (!pos[p].empty()) {
          upd(pos[p].back(), 1LL * inv[p] * (p - 1) % 1000000007);
        }
      }
      now++;
    }
    ans[qq[i].id] = mul(qq[i].r);
  }
  for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
  return 0;
}
