#include<bits/stdc++.h>
#define ll long long
#define Cr(F, n) memset(F, 0, sizeof(int) * (n))
using namespace std;
const int mod = 998244353;
const int N = 4e5 + 10; 
int limit, p, rev[N << 3];
int C[N << 3], D[N << 3];
inline void init(const int &n) {
    for(limit = 1, p = 0; limit <= n; limit <<= 1, ++p);
    for(int i = 0; i < limit; i++) {
        rev[i] = (rev[i >> 1] >> 1 | (i & 1) << (p - 1));
    } 
}
inline int ADD(const int &x, const int &y) { return x + y >= mod ? x + y - mod : x + y; }
inline int SUB(const int &x, const int &y) { return x - y < 0 ? x - y + mod : x - y; }
inline int NY(int x, int p = mod - 2, int mul = 1) {
    for(; p; p >>= 1, x = 1LL * x * x % mod)
        if(p & 1) mul = 1LL * mul * x % mod;
    return mul;
}
inline void NTT(int *f, const int &type, int limit = limit) {
    int i, j, k;
    for(i = 0; i < limit; i++) {
        if(i < rev[i]) {
            swap(f[i], f[rev[i]]);
        }
    }   
    for(i = 1; i < limit; i <<= 1) {
        int m = i << 1, D = NY(3, type == 1 ? (mod - 1) / m : mod - 1 - (mod - 1) / m);
        for(j = 0; j < limit; j += m) {
            int W = 1;
            for(k = 0; k < i; k++, W = 1LL * W * D % mod) {
                int x = f[j + k], y = 1LL * f[i + j + k] * W % mod;
                f[j + k] = ADD(x, y), f[i + j + k] = SUB(x, y);
            }
        }
    }
    if(type == -1) {
        int Inv = NY(limit);
        for(i = 0; i < limit; i++) {
            f[i] = 1LL * f[i] * Inv % mod;
        }
    }
}
const int lg = 20;
int n;
int a[N], ans[N], b[N];
map<int, int> M;
vector< int > pos[N];
struct RMQ {
    int st[lg][N];
    void init() {
        for(int i = 1; i <= n; i++) {
            st[0][i] = a[i];
        }
        for(int i = 1; i < lg; i++) {
            for(int j = 1; j <= n - (1 << i) + 1; j++) {
                st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
            }
        }
    }
    int query(int l, int r) {
        int k = __lg(r - l + 1);
        return max(st[k][l], st[k][r - (1 << k) + 1]);
    }
} R;
void Fz(int l, int r) {
    if(l == r) {
        ans[1]++;
        return;
    }
    int id = M[R.query(l, r)];
    int base = lower_bound(pos[id].begin(), pos[id].end(), l) - pos[id].begin();
    vector< int > c;
    int pre = l - 1; 
    for(int i = base; i < pos[id].size(); i++) {
        if(pos[id][i] > r) break;
        int cur = pos[id][i];
        if(cur - pre != 1) {
            Fz(pre + 1, cur - 1);
        }
        c.push_back(cur - pre);
        pre = cur;
    }
    if(r != pre) {
        Fz(pre + 1, r);
    }
    c.push_back(r - pre + 1);
    
    int siz = c.size();
    init(siz * 2 + 5);
    Cr(C, limit); Cr(D, limit);
    for(int i = 0; i < siz; i++) {
        C[i] = c[i];
    }
    int cpr = 0;
    for(int i = siz - 1; i >= 0; i--) {
        D[i] = c[cpr++];
    }
    NTT(C, 1); NTT(D, 1);
    for(int i = 0; i < limit; i++) {
        C[i] = 1LL * C[i] * D[i] % mod;
    }
    NTT(C, -1);
    int mx = siz - 1, posss = 0;
    for(int i = 1; i <= siz - 1; i++) {
        (ans[mx--] += C[posss++]) %= mod;
    }
}
void solve() {
    cin >> n;
    for(int i = 1; i <= n; i++) { ans[i] = 0; }
    
    for(int i = 1; i <= n; i++) {
        cin >> a[i]; b[i] = a[i];
    }
    R.init();
    sort(b + 1, b + 1 + n);
    int pre = 0;
    int cnt = 0;
    for(int i = 1; i <= n; i++) {
        if(b[i] != pre) {
            M[b[i]] = ++cnt; 
            pre = b[i];
        }
    }
    for(int i = 1; i <= n; i++) {
        pos[M[a[i]]].push_back(i);
    }
    Fz(1, n);
    int Ans = 0;
    for(int i = 1; i <= n; i++) {
        (Ans += 1LL * ans[i] * ans[i] % mod * i % mod) %= mod;
    }
    cout << Ans << '\n';
    for(int i = 1; i <= cnt; i++) {
        pos[i].clear();
    }
    M.clear();
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
}