#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long fac(int x) {
  long long temp = 1;
  for (int i = 1; i <= x; i++) {
    temp *= i;
    temp %= mod;
  }
  return temp;
}
long long inv(long long x) {
  int k = 0;
  long long ans = 1, temp = x;
  while ((1LL << k) <= mod - 2) {
    if ((1LL << k) & (mod - 2)) {
      ans *= temp;
      ans %= mod;
    }
    temp *= temp;
    temp %= mod;
    k++;
  }
  return ans;
}
long long comb(int x) {
  long long temp = fac(2 * x), temp2 = inv(fac(x));
  temp2 *= temp2;
  temp2 %= mod;
  temp *= temp2;
  temp %= mod;
  return temp;
}
long long a[150002], b[150002];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int i = 0; i < n; i++) {
    scanf("%lld", &b[i]);
  }
  sort(a, a + n);
  sort(b, b + n);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += abs(b[i] - a[n - 1 - i]);
    sum %= mod;
  }
  long long ans = sum;
  ans *= comb(n);
  ans %= mod;
  printf("%lld", ans);
}
