#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
int p[1000005], inv[1000005];
long long fastPow(long long x, long long y) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % 1000000007;
    x = x * x % 1000000007;
    y >>= 1;
  }
  return ans;
}
void init() {
  for (int i = 2; i < 1000005; i++)
    if (!p[i]) {
      for (int j = i; j < 1000005; j += i) {
        p[j] = i;
      }
    }
  inv[0] = 1;
  for (int(i) = 1; (i) <= (int)(1000005 - 1); (i)++)
    inv[i] = fastPow(i, 1000000007 - 2);
}
int a[1000005];
int b[1000005], nxt[1000005];
void update(int x, long long val) {
  for (int i = x; i <= n; i += i & -i) {
    b[i] = (long long)b[i] * val % 1000000007;
  }
}
int query(int x) {
  int ret = 1;
  for (; x > 0; ret = (long long)ret * b[x] % 1000000007, x -= x & -x)
    ;
  return ret;
}
vector<pair<int, int> > ap[1000005];
int ans[1000005];
void fmain() {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  for (int(i) = 1; (i) <= (int)(n); (i)++) b[i] = 1;
  for (int(i) = 0; (i) < (int)(1000005); (i)++) nxt[i] = n + 1;
  init();
  scanf("%d", &m);
  for (int l, r, i = 1; i <= m; i++) {
    scanf("%d%d", &l, &r);
    ap[l].push_back({r, i});
  }
  for (int i = n; i >= 1; i--) {
    int tar = a[i];
    while (tar > 1) {
      int pri = p[tar], tmp = 1;
      while (tar % pri == 0) {
        tar /= pri;
        tmp *= pri;
      }
      update(i, (long long)tmp / pri * (pri - 1) % 1000000007);
      if (nxt[pri] <= n) {
        update(nxt[pri], (long long)pri * inv[pri - 1] % 1000000007);
      }
      nxt[pri] = i;
    }
    for (auto c : ap[i]) {
      ans[c.second] = query(c.first);
    }
  }
  for (int(i) = 1; (i) <= (int)(m); (i)++) printf("%d\n", ans[i]);
}
int main() {
  fmain();
  return 0;
}
