#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int MOD = 1e9 + 7;
long long ksm(long long a, long long b, long long mod) {
  long long res = 1, base = a;
  while (b) {
    if (b & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    b >>= 1;
  }
  return res;
}
vector<long long> prime;
bool vis[maxn];
vector<int> factor[maxn];
void PHI(int n) {
  memset(vis, 1, sizeof(vis));
  for (int i = 2; i <= n; i++) {
    if (vis[i]) prime.push_back(i);
    for (int j = 0; j < prime.size() && i * prime[j] <= n; j++) {
      vis[i * prime[j]] = 0;
      if (i % prime[j] == 0) break;
    }
  }
  for (int i = 0; i < prime.size(); i++) {
    for (int k = 1; k * prime[i] <= n; k++) {
      factor[k * prime[i]].push_back(prime[i]);
    }
  }
}
int N, Q;
long long a[maxn], sum[maxn] = {1};
struct AAA {
  int L, R, id;
  bool operator<(const AAA &tp) const { return R < tp.R; }
};
AAA q[maxn];
long long tree[maxn];
void Add(int i, long long val) {
  if (i < 1) return;
  for (; i < maxn; i += i & -i) tree[i] = (tree[i] * val) % MOD;
}
long long getsum(int i) {
  long long res = 1;
  for (; i >= 1; i -= i & -i) res = (res * tree[i]) % MOD;
  return res;
}
int main() {
  PHI(maxn - 5);
  while (cin >> N) {
    for (int i = 0; i < maxn; i++) tree[i] = 1;
    for (int i = 1; i <= N; i++) {
      scanf("%lld", a + i);
      sum[i] = sum[i - 1] * a[i] % MOD;
    }
    cin >> Q;
    for (int i = 1; i <= Q; i++) {
      scanf("%d%d", &q[i].L, &q[i].R);
      q[i].id = i;
    }
    sort(q + 1, q + 1 + Q);
    static int last[maxn];
    memset(last, 0, sizeof last);
    static int ans[maxn];
    int now = 1;
    for (int i = 1; i <= N; i++) {
      for (int j = 0; j < factor[a[i]].size(); j++) {
        long long p = factor[a[i]][j];
        if (last[p]) Add(last[p], p * ksm(p - 1, MOD - 2, MOD) % MOD);
        Add(i, (long long)(p - 1) * ksm(p, MOD - 2, MOD) % MOD);
        last[p] = i;
      }
      while (q[now].R == i) {
        int id = q[now].id;
        int qL = q[now].L;
        ans[id] = sum[i] * ksm(sum[qL - 1], MOD - 2, MOD) % MOD * getsum(i) %
                  MOD * ksm(getsum(qL - 1), MOD - 2, MOD) % MOD;
        now++;
      }
    }
    for (int i = 1; i <= Q; i++) printf("%d\n", ans[i]);
  }
}
