#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAX = 1001000;
int n, m, vis[MAX], a[MAX];
long long ret;
vector<int> p[MAX];
struct query {
  int l, r;
  int id;
  bool operator<(const query& A) const { return r < A.r; }
} q[MAX];
long long pow_mod(int a, int b) {
  if (!b) return 1;
  long long ans = pow_mod(a, b / 2);
  ans = (ans * ans) % mod;
  if (b & 1) ans = (ans * a) % mod;
  return ans;
}
long long get_inv(int x) { return pow_mod(x, mod - 2); }
void init(int n) {
  memset(vis, 0, sizeof(vis));
  for (int i = 2; i <= n; i++)
    if (!vis[i]) {
      for (int j = i; j <= n; j += i) {
        vis[j] = 1;
        p[j].push_back(i);
      }
    }
}
int ans[MAX], last[MAX];
long long c[MAX], pre[MAX];
inline int lowbit(int x) { return x & -x; }
void mul(int x, int val) {
  while (x <= n) {
    c[x] = (c[x] * val) % mod;
    x += lowbit(x);
  }
}
long long getmul(int x) {
  ret = 1;
  while (x > 0) {
    ret = (ret * c[x]) % mod;
    x -= lowbit(x);
  }
  return ret;
}
void work() {
  pre[0] = 1;
  int cur = 1;
  memset(last, 0, sizeof(last));
  for (int i = 1; i <= n; i++) c[i] = 1;
  for (int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] * a[i] % mod;
    for (int j = 0; j < p[a[i]].size(); j++) {
      int tmp = p[a[i]][j];
      if (last[tmp]) {
        mul(last[tmp], tmp);
        mul(last[tmp], get_inv(tmp - 1));
      }
      mul(i, tmp - 1);
      mul(i, get_inv(tmp));
      last[tmp] = i;
    }
    while (cur <= m && q[cur].r == i) {
      ans[q[cur].id] = getmul(i) * get_inv(getmul(q[cur].l - 1)) % mod *
                       pre[i] % mod * get_inv(pre[q[cur].l - 1]) % mod;
      cur++;
    }
  }
}
int main() {
  init(1000010);
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &q[i].l, &q[i].r);
    q[i].id = i;
  }
  sort(q + 1, q + 1 + m);
  work();
  for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
  return 0;
}
