#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 998244353;
const int N = 3e5, M = N;
vector<int> g[N];
int a[N];
long long add(long long a, long long b) {
  long long ans = ((a % mod) + (b % mod)) % mod;
  return ans;
}
long long multiply(long long a, long long b) {
  long long ans = ((a % mod) * (b % mod)) % mod;
  return ans;
}
void solve() {
  long long i, j, n, k, data, m, f = 1;
  cin >> n;
  vector<long long> a, b;
  set<long long> st;
  for (i = 0; i < n; i++) {
    cin >> data;
    a.push_back(data);
  }
  for (i = 0; i < n; i++) {
    cin >> data;
    b.push_back(data);
  }
  vector<long long> v;
  for (i = 0; i < n; i++) {
    data = a[i] * (i + 1) * (n - i);
    v.push_back(data);
  }
  sort(v.begin(), v.end());
  sort(b.begin(), b.end());
  reverse(b.begin(), b.end());
  long long ans = 0;
  for (i = 0; i < n; i++) {
    long long x = v[i];
    data = multiply(b[i], x);
    ans = add(ans, data);
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % mod;
    base = ((long long)base * base) % mod;
    exp >>= 1;
  }
  return result;
}
void ipgraph(int n, int m) {
  int i, u, v;
  while (m--) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
}
void dfs(int u, int par) {
  for (int v : g[u]) {
    if (v == par) continue;
    dfs(v, u);
  }
}
