#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 1e6 + 5, mo = 1e9 + 7;
int n, m, Q, i, a[N], p[M], ans[N];
int he[N];
struct edge {
  int l, to;
} e[N];
int read() {
  char c = getchar();
  int k = 0;
  for (; c < 48 || c > 57; c = getchar())
    ;
  for (; c > 47 && c < 58; c = getchar()) k = (k << 3) + (k << 1) + c - 48;
  return k;
}
void write(int x) {
  if (x > 9) write(x / 10);
  putchar(x % 10 + 48);
}
int t, pr[M], d[M], inv[M];
void init(int n) {
  inv[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!d[i]) pr[++t] = i, d[i] = i;
    for (int j = 1; i * pr[j] <= n; j++) {
      d[i * pr[j]] = pr[j];
      if (i % pr[j] == 0) break;
    }
    inv[i] = (long long)inv[mo % i] * (mo - mo / i) % mo;
  }
}
int f[N];
void add(int x, int k) {
  for (; x <= n; x += x & -x) f[x] = (long long)f[x] * k % mo;
}
int ask(int x) {
  int k = 1;
  for (; x; x -= x & -x) k = (long long)k * f[x] % mo;
  return k;
}
int main() {
  for (n = read(), i = 1; i <= n; i++) m = max(m, a[i] = read());
  init(m);
  for (Q = read(), i = 1; i <= Q; i++) {
    int x = read(), y = read();
    e[i].l = he[x];
    he[x] = i;
    e[i].to = y;
  }
  for (i = 1; i <= n; i++) f[i] = 1;
  for (int x = n; x; x--) {
    add(x, a[x]);
    for (int k = a[x]; k > 1; k /= d[k]) {
      int dx = d[k];
      if (p[dx] == x) continue;
      int vx = (long long)(dx - 1) * inv[dx] % mo;
      int vy = (long long)dx * inv[dx - 1] % mo;
      if (p[dx]) add(p[dx], vy);
      p[dx] = x;
      add(x, vx);
    }
    for (i = he[x]; i; i = e[i].l) ans[i] = ask(e[i].to);
  }
  for (i = 1; i <= Q; i++) write(ans[i]), putchar('\n');
}
