#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = 1e6 + 5, mod = 1e9 + 7;
int bpow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = 1ll * ans * a % mod;
    b >>= 1;
    a = 1ll * a * a % mod;
  }
  return ans;
}
int fen[N];
void mul(int p, int val) {
  for (p++; p < N; p += p & -p) fen[p] = 1LL * fen[p] * val % mod;
}
int _get(int p) {
  int ans = 1;
  for (; p > 0; p -= p & -p) ans = 1LL * ans * fen[p] % mod;
  return ans;
}
int get(int l, int r) { return 1LL * _get(r) * bpow(_get(l), mod - 2) % mod; }
int last[M], a[N], ans[N], rev[M];
vector<int> ps[M];
vector<pair<int, int> > qs[N];
void test() {
  while (1) {
    int n;
    cin >> n;
    for (int i = 0; i < ps[n].size(); i++) cout << ps[n][i] << " ";
    cout << endl;
  }
}
int main() {
  ios::sync_with_stdio(0);
  for (int i = 0; i < N; i++) fen[i] = 1;
  for (int i = 2; i < M; i++) {
    if (ps[i].size()) continue;
    for (int j = i; j < M; j += i) ps[j].push_back(i);
  }
  for (int i = 0; i < M; i++) rev[i] = bpow(i, mod - 2);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    qs[r].push_back(make_pair(l, i));
  }
  memset(last, -1, sizeof last);
  for (int i = 0; i < n; i++) {
    mul(i, a[i]);
    for (int j = 0; j < ps[a[i]].size(); j++) {
      int np = ps[a[i]][j];
      int fp = 1ll * (np - 1) * rev[np] % mod;
      if (last[np] != -1) mul(last[np], 1ll * np * rev[np - 1] % mod);
      last[np] = i;
      mul(i, fp);
    }
    for (int j = 0; j < qs[i].size(); j++) {
      pair<int, int> q = qs[i][j];
      ans[q.second] = get(q.first, i + 1);
    }
  }
  for (int i = 0; i < m; i++) cout << ans[i] << endl;
  return 0;
}
