#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const ll MOD = 998244353;
const ll TWO = (MOD + 1) / 2;
const ll INF = 1e13;

ll floor(ll a, ll b) {
    return a / b - (a % b && ((a < 0) ^ (b < 0)));
}

ll ceil(ll a, ll b) {
    return a / b + (a % b && ((a < 0) ^ (b > 0)));
}

ll lft[300005], rgt[300005];

void add(ll &x, ll val) {
    x = (x + val) % MOD;
}

ll get_sum(ll l, ll r) {
    l %= MOD;
    r %= MOD;
    return (l + r) * (r + MOD - l + 1) % MOD * TWO % MOD;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    int a = -1, b = -1;
    ll ans = 0;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> lft[i];
    for (int i = 1; i <= n; ++i) {
        cin >> rgt[i];
        if (lft[i] == rgt[i]) {
            if (a == -1) a = i;
            else if (b == -1) b = i;
        }
    }

    if (b != -1) {
        for (int i = 1; i <= n; ++i) {
            ll p = lft[a] * (b - i) + lft[b] * (i - a);
            ll q = b - a;
            if (p % q != 0)
                return cout << "0\n", 0;
            if (p / q < lft[i] || p / q > rgt[i])
                return cout << "0\n", 0;
        }
        return cout << "1\n", 0;
    }

    vector<pll> fL, fR;
    for (int i = 1; i <= n; ++i) {
        while (SZ(fL) >= 2 && fL.back().Y >= ceil(lft[fL[SZ(fL) - 2].X] - lft[i], i - fL[SZ(fL) - 2].X))
            fL.pop_back();
        if (fL.empty()) fL.pb(pll(i, -INF));
        else fL.pb(pll(i, ceil(lft[fL.back().X] - lft[i], i - fL.back().X)));
    }
    for (int i = n; i >= 1; --i) {
        while (SZ(fR) >= 2 && fR.back().Y >= ceil(rgt[i] - rgt[fR[SZ(fR) - 2].X], fR[SZ(fR) - 2].X - i))
            fR.pop_back();
        if (fR.empty()) fR.pb(pll(i, -INF));
        else fR.pb(pll(i, ceil(rgt[i] - rgt[fR.back().X], fR.back().X - i)));
    }

    ll nw = -INF;
    int flag = 0;
    for (int i = 0, j = 0; i < SZ(fL) && j < SZ(fR);) {
        while (i + 1 < SZ(fL) && nw >= fL[i + 1].Y) ++i;
        while (j + 1 < SZ(fR) && nw >= fR[j + 1].Y) ++j;
        ll Lnxt, Rnxt;
        if (i + 1 < SZ(fL)) Lnxt = fL[i + 1].Y;
        else Lnxt = INF;
        if (j + 1 < SZ(fR)) Rnxt = fR[j + 1].Y;
        else Rnxt = INF;
        ll nxt = min(Lnxt, Rnxt) - 1;
        
        auto cal = [&]() {
            if (nw > nxt) return;
            add(ans, nxt - nw + 1);
            add(ans, (nxt - nw + 1) % MOD * (rgt[fR[j].X] % MOD));
            add(ans, fR[j].X * get_sum(nw, nxt));
            add(ans, MOD - (nxt - nw + 1) % MOD * (lft[fL[i].X] % MOD) % MOD);
            add(ans, MOD - fL[i].X * get_sum(nw, nxt) % MOD);
        };
        
        if (nxt * fL[i].X + lft[fL[i].X] <= nxt * fR[j].X + rgt[fR[j].X]) {
            if (!flag) {
                if (nw * fL[i].X + lft[fL[i].X] > nw * fR[j].X + rgt[fR[j].X])
                    nw = ceil(rgt[fR[j].X] - lft[fL[i].X], fL[i].X - fR[j].X);
                flag = 1;
            }
            cal();
        }
        else if (flag) {
            nxt = floor(rgt[fR[j].X] - lft[fL[i].X], fL[i].X - fR[j].X);
            cal();
            break;
        }
        else {
            ll tnw = nw, tnxt = nxt;
            if (nw * fL[i].X + lft[fL[i].X] > nw * fR[j].X + rgt[fR[j].X])
                nw = ceil(rgt[fR[j].X] - lft[fL[i].X], fL[i].X - fR[j].X);
            nxt = floor(rgt[fR[j].X] - lft[fL[i].X], fL[i].X - fR[j].X);
            if (nxt <= tnxt && nw >= tnw)
                cal();
            nw = tnw, nxt = tnxt;
        }
        nw = nxt + 1;

        if (i + 1 == SZ(fL) && j + 1 == SZ(fR)) break;
    }

    cout << ((ans % MOD) + MOD) % MOD << "\n";
}