#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

// (a, b) <-> a + bx

long long upper(long long a, long long b) {
    if (a >= 0)
        return (a + b - 1) / b;
    return -((-a) / b);
}

long long inter(const pair<long long, long long>& line1, const pair<long long, long long>& line2) {
    return upper(line2.first - line1.first, line1.second - line2.second);
}

struct CHT {
    vector<pair<long long, long long>> lines;
    vector<long long> points;
    void push_back(const pair<long long, long long>& line) {
        if (lines.empty()) {
            lines.emplace_back(line);
            return;
        }
        while (!points.empty() && points.back() >= inter(lines.back(), line)) {
            lines.pop_back();
            points.pop_back();
        }
        points.emplace_back(inter(lines.back(), line));
        lines.emplace_back(line);
    }
};

const long long INF = 1e12 + 1e8;
const long long MOD = 998244353;
const long long half = (MOD + 1) / 2;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<long long> L(n);
    vector<long long> R(n);
    for (int i = 0; i < n; ++i)
        cin >> L[i];
    for (int i = 0; i < n; ++i)
        cin >> R[i];
    CHT cht1;
    CHT cht2;
    for (int i = 0; i < n; ++i)
        cht1.push_back(make_pair(R[i] + 1, -i));
    for (int i = n - 1; i >= 0; --i)
        cht2.push_back(make_pair(-L[i], i));
    long long cur = -INF;
    int id1 = 0, id2 = 0;
    long long ans = 0;
    while (true) {
        long long nxt = min(id1 == cht1.points.size() ? INF : cht1.points[id1],
                            id2 == cht2.points.size() ? INF : cht2.points[id2]);
        long long a = cht1.lines[id1].first + cht2.lines[id2].first;
        long long b = cht1.lines[id1].second + cht2.lines[id2].second;
        long long L = cur, R = nxt;
        if (b > 0)
            L = max(L, upper(-a, b));
        else if (b < 0)
            R = min(R, upper(a, -b));
        else if (a < 0)
            L = R;
        if (R > L)
            ans = (ans + (R - L) % MOD * ((R + L - 1) % MOD) % MOD * half % MOD * (b % MOD) + (R - L) % MOD * (a % MOD))% MOD;
        if (nxt == INF)
            break;
        if (id1 < cht1.points.size() && cht1.points[id1] == nxt)
            ++id1;
        if (id2 < cht2.points.size() && cht2.points[id2] == nxt)
            ++id2;
        cur = nxt;
    }
    cout << ans << '\n';
    return 0;
}