#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = atcoder::modint998244353;
#define BL  58
#define BL2 447
// 59 ~ 447

template <class T, T (*op)(T, T), T (*e)()> struct SparseTable {
    int n, LOGV;
    std::vector<std::vector<T>> table;
    std::vector<int> log_table;
    SparseTable() {}
    SparseTable(const std::vector<T> &v) : n(v.size()), LOGV(std::__lg(std::max(n, 1)) + 1), 
                                           log_table(n + 1), table(LOGV, std::vector<T>(n)) {
        std::copy(v.begin(), v.end(), table[0].begin());
        for(int i = 1; i < LOGV; i++) {
            for(int j = 0; j + (1 << i) <= n; j++) {
                table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
            }
        }
        for(int i = 2; i <= n; i++) {
            log_table[i] = log_table[i >> 1] + 1;
        }
    }
    T prod(int l, int r){
        assert(0 <= l && l <= r && r <= n);
        if(l == r) return e();
        int b = log_table[r - l];
        return op(table[b][l], table[b][r - (1 << b)]);
    }
};

mint op(mint lhs, mint rhs){ return lhs * rhs; }
mint e(){return 1;}
int op2(int lhs, int rhs){return max(lhs, rhs);}
constexpr int e2(){return 1;}
ll op3(ll lhs, ll rhs){return lhs | rhs;}
constexpr ll e3(){return 0;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<mint> tmp(n, 1);
    constexpr int r = 200000;
    vector<int> id(r + 1), tb(r + 1), p2;
    tb[0] = tb[1] = -1;
    int pcnt = 0;
    for(int i = 2; i <= r; i++){
        if(tb[i] != 0) continue;
        if(i <= BL) id[i] = pcnt++;
        else if(i <= BL2){
            id[i] = p2.size();
            p2.emplace_back(i);
        }
        for(int j = i; j <= r; j += i){
            if(tb[j] == 0) tb[j] = i;
        }
    }
    const int m = pcnt;
    vector<vector<int>> seg2(m, vector<int>(n, 1));
    vector<vector<ll>> seg3(3, vector<ll>(n));
    for(int i = 0; i < n; i++){
        int v;
        cin >> v;
        while(v != 1){
            if(tb[v] <= BL) seg2[id[tb[v]]][i] *= tb[v];
            else if(tb[v] <= BL2){
                int mi = id[tb[v]] / 24, si = 2 * (id[tb[v]] % 24);
                if(seg3[mi][i] >> si & 1) seg3[mi][i] |= 1ll << (si + 1);
                else seg3[mi][i] |= 1ll << si;
            }
            else tmp[i] *= tb[v];
            v /= tb[v];
        }
    }
    segtree<mint, op, e> seg(tmp);
    vector<SparseTable<int, op2, e2>> seg4(m);
    vector<SparseTable<ll, op3, e3>> seg5(3);
    for(int i = 0; i < m; i++) seg4[i] = SparseTable<int, op2, e2>(seg2[i]);
    for(int i = 0; i < 3; i++) seg5[i] = SparseTable<ll, op3, e3>(seg3[i]);
    int Q;
    cin >> Q;
    mint ans = 1;
    while(Q--){
        int a, b;
        cin >> a >> b;
        int l = (a * ans).val() % n, r = (b * ans).val() % n;
        if(l > r) swap(l, r);
        r++;
        ans = seg.prod(l, r);
        for(int i = 0; i < m; i++) ans *= seg4[i].prod(l, r);
        for(int i = 0; i < 3; i++){
            ll S = seg5[i].prod(l, r);
            for(int j = 0; j < 24; j++){
                if(S >> (2 * j) & 1) ans *= p2[j + i * 24]; 
                if(S >> (2 * j + 1) & 1) ans *= p2[j + i * 24];
            }
        }
        cout << ans.val() << '\n';
    }
}