#include <bits/stdc++.h>
using namespace std;
long long bigMod(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res = (res * x) % 1000000007;
      y--;
    } else {
      x = (x * x) % 1000000007;
      y >>= 1;
    }
  }
  return res;
}
struct query {
  int l, r, id;
} Q[200005];
const int k = 450;
int ara[200005], freq[1000006];
bool cmp(query &a, query &b) {
  int b1 = a.l / k, b2 = b.l / k;
  if (b1 == b2) return a.r < b.r;
  return b1 < b2;
}
int l = 0, r = -1, ans[200005];
long long sum, res;
vector<int> fac[200005];
void Add(int x) {
  sum = (sum * ara[x]) % 1000000007;
  for (auto &y : fac[x]) {
    if (!freq[y]) {
      sum = (sum * (y - 1)) % 1000000007;
      res = (res * y) % 1000000007;
    }
    freq[y]++;
  }
}
void Del(int x) {
  res = (res * ara[x]) % 1000000007;
  for (auto &y : fac[x]) {
    freq[y]--;
    if (!freq[y]) {
      res = (res * (y - 1)) % 1000000007;
      sum = (sum * y) % 1000000007;
    }
  }
}
vector<int> prime;
bitset<1000006> a;
void sieve() {
  a[0] = a[1] = 1;
  for (int i = 4; i < 200005; i += 2) a[i] = 1;
  for (int i = 3; i * i < 200005; i++) {
    if (!a[i]) {
      for (int j = i * i; j < 200005; j += 2 * i) a[j] = 1;
    }
  }
  prime.push_back(2);
  for (int i = 3; i < 200005; i += 2)
    if (!a[i]) prime.push_back(i);
}
void primefact(int n) {
  int x = n;
  n = ara[n];
  for (int i = 0; prime[i] * prime[i] <= n && i < int(prime.size()); i++) {
    if (n % prime[i] == 0) {
      while (n % prime[i] == 0) {
        n /= prime[i];
      }
      fac[x].push_back(prime[i]);
    }
  }
  if (n > 1) {
    fac[x].push_back(n);
  }
}
int main() {
  sieve();
  int q, n;
  scanf("%d", &n);
  for (int i = int(0); i < int(n); i++) {
    scanf("%d", &ara[i]);
    primefact(i);
  }
  scanf("%d", &q);
  for (int i = int(0); i < int(q); i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--, y--;
    Q[i].l = x, Q[i].r = y;
    Q[i].id = i;
  }
  sum = 1;
  sort(Q, Q + q, cmp);
  for (int i = int(0); i < int(q); i++) {
    res = 1;
    while (l > Q[i].l) Add(--l);
    while (r < Q[i].r) Add(++r);
    while (l < Q[i].l) Del(l++);
    while (r > Q[i].r) Del(r--);
    sum = (sum * bigMod(res, 1000000007 - 2)) % 1000000007;
    ans[Q[i].id] = sum;
  }
  for (int i = int(0); i < int(q); i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
