#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
unsigned long long n, a[N], b[N], ans;
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] *= i * (n - i + 1);
    }
    for(int i = 1; i <= n; i++)
        cin >> b[i];
    sort(a + 1, a + n + 1, greater<unsigned long long>());//greater可以用来从大到小排序
    sort(b + 1, b + n + 1);
    for(int i = 1; i <= n; i++)
        ans = (ans + a[i] % 998244353 * b[i] % 998244353) % 998244353;
    cout << ans << endl;
    return 0;
}