#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using pii = pair<int, int>;
const int mod = 998244353;
// [cur][max_ave][-2][-1]
using ll = long long;
int dp[2][2][2][2];
void add(int& x, int y) {
    x = x + y >= mod ? x + y - mod : x + y;
}
void sub(int& x, int y) {
    x = x >= y ? x - y : x + mod - y;
}

int qpow(int x, int t) {
    int res = 1;
    for (; t; t >>= 1, x = 1ll * x * x % mod)
        if (t & 1) res = 1ll * res * x % mod;
    return res;
}

int Lagrange(const vector<int>& x, const vector<int>& y, int n, int X) {
    int res = 0;
    for (int i = 0; i <= n; i++) {
        int s1 = 1, s2 = 1;
        for (int j = 0; j <= n; j++)
            if (i ^ j) {
                s1 = 1ll * s1 * (X - x[j]) % mod;
                s2 = 1ll * s2 * (x[i] - x[j]) % mod;
            }
        res = (res + 1ll * (1ll * s1 * qpow(s2, mod - 2) % mod) * y[i]) % mod;
    }
    return (res % mod + mod) % mod;
}

void solve() {
    int n;
    cin >> n;
    vector<int> v(2 * n);
    vector<int> l(n);
    vector<int> r(n);
    for (int i = 0; i < n; ++i) cin >> l[i], v[i] = l[i];
    for (int i = 0; i < n; ++i) cin >> r[i], v[i + n] = r[i] + 1;

    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    // auto rk = [&](int a) -> int {
    //     return lower_bound(v.begin(), v.end(), a) - v.begin();
    // };
    // 中位数大于等于a的有多少种情况
    auto query = [&](int a) -> int {
        int cur = 0;
        dp[cur][1][0][0] = 0;
        // t1 有几个数比a小
        int t1 = l[0] >= a ? 0 : (r[0] < a ? r[0] - l[0] + 1 : a - l[0]);
        int t2 = l[1] >= a ? 0 : (r[1] < a ? r[1] - l[1] + 1 : a - l[1]);
        int t3 = r[0] - l[0] + 1 - t1;
        int t4 = r[1] - l[1] + 1 - t2;
        dp[cur][0][0][0] = 1ll * t1 * t2 % mod;
        dp[cur][0][1][0] = 1ll * t3 * t2 % mod;
        dp[cur][0][0][1] = 1ll * t1 * t4 % mod;
        dp[cur][0][1][1] = 1ll * t3 * t4 % mod;

        for (int i = 2; i < n; ++i) {
            int t1 = l[i] >= a ? 0 : (r[i] < a ? r[i] - l[i] + 1 : a - l[i]);
            int t3 = r[i] - l[i] + 1 - t1;
            dp[cur ^ 1][1][0][0] = 1ll * dp[cur][1][0][0] * (t1 + t3) % mod;
            for (int i = 0; i < 2; ++i)
                for (int j = 0; j < 2; ++j) dp[cur ^ 1][0][i][j] = 0;

            for (int a1 = 0; a1 < 2; ++a1) {
                for (int a2 = 0; a2 < 2; ++a2) {
                    for (int a3 = 0; a3 < 2; ++a3) {
                        int num = a3 == 0 ? t1 : t3;
                        if (a1 + a2 + a3 >= 2)
                            add(dp[cur ^ 1][1][0][0], 1ll * dp[cur][0][a1][a2] * num % mod);
                        else {
                            add(dp[cur ^ 1][0][a2][a3], 1ll * dp[cur][0][a1][a2] * num % mod);
                        }
                    }
                }
            }
            cur ^= 1;
        };
        return dp[cur][1][0][0];
    };

    ll ans = 0;
    vector<int> X(160);
    for (int i = 0; i < 160; ++i) X[i] = i;

    for (int i = 1; i < v.size(); ++i) {
        int l = v[i - 1], r = v[i] - 1;
        vector<int> tmp(160);
        vector<int> tmp2(160);
        if (r - l <= 157) {
            for (int i = l; i <= r + 1; ++i) {
                tmp[i - l] = query(i);
            }
            for (int i = 0; i <= r - l; ++i) {
                sub(tmp[i], tmp[i + 1]);
                ans += 1ll * tmp[i] * (i + l) % mod;
            }
            continue;
        } else {
            for (int i = 0; i <= 155; ++i) {
                tmp[i] = query(i + l);
            }
            for (int i = 0; i < 155; ++i) {
                sub(tmp[i], tmp[i + 1]);
                tmp2[i] = ((i ? tmp2[i - 1] : 0) + 1ll * tmp[i] * (i + l)) % mod;
            }
            ans += Lagrange(X, tmp2, 154, r - l);
        }
    }
    cout << ans << '\n';
}

int main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    int t;
    cin >> t;
    while (t--) solve();
}
/*
5
3
1 1 1
1 1 1
3
1 1 1
1 2 2
4
1 100 6 400
1 300 6 800
3
1 1 1
2 2 2
5
1 3 7 4 2
1 9 8 4 3

1
5
16120200
12
164

*/