#include <bits/stdc++.h>
int n, a[200011], minp[1000011], b[1000011], v, prime[1000011], t[200011], m,
    ans[200011];
const long long mod = 1e9 + 7;
using namespace std;
struct Node {
  int l, r, num;
} q[200011];
inline bool cmp(Node a, Node b) { return a.r < b.r; }
inline void predeal() {
  int tot = 0;
  for (int i = 2; i <= v; i++) {
    if (!minp[i]) prime[tot++] = i, minp[i] = i;
    for (int j = 0; j < tot; j++) {
      if (prime[j] * i > v) break;
      minp[prime[j] * i] = prime[j];
      if (i % prime[j] == 0) break;
    }
  }
  for (int i = 0; i <= n; i++) t[i] = 1;
}
inline int pow(int a, long long b) {
  int r = 1, base = a;
  while (b) {
    if (b & 1) r = (long long)r * base % mod;
    base = (long long)base * base % mod;
    b >>= 1;
  }
  return r % mod;
}
inline void modify(int x, int z) {
  for (int i = x; i <= n; i += i & -i) t[i] = (long long)t[i] * z % mod;
}
inline int query(int x) {
  int temp = 1;
  for (int i = x; i; i -= i & -i) temp = (long long)temp * t[i] % mod;
  return temp;
}
inline void change(int p) {
  int x = a[p];
  while (x != 1) {
    int now = minp[x];
    if (b[now]) {
      modify(b[now], pow(now - 1, mod - 2));
      modify(b[now], now);
    }
    b[now] = p;
    modify(p, now - 1);
    x /= now;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  v = *max_element(a + 1, a + 1 + n);
  predeal();
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].num = i;
  }
  sort(q + 1, q + 1 + m, cmp);
  for (int i = 1, now = 1; i <= m; i++) {
    while (now <= q[i].r) change(now++);
    ans[q[i].num] =
        (long long)query(q[i].r) * pow(query(q[i].l - 1), mod - 2) % mod;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
  return 0;
}
