#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n;
int a[(300000 + 5)];
int fac[(300000 + 5)], ifac[(300000 + 5)];
int ans;
int Pow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = (long long)res * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return res;
}
int C(int x, int y) {
  return (long long)fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n + n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + n + n + 1);
  fac[0] = 1;
  for (int i = 1; i <= n + n; ++i) fac[i] = (long long)fac[i - 1] * i % mod;
  ifac[n + n] = Pow(fac[n + n], mod - 2);
  for (int i = n + n - 1; ~i; --i)
    ifac[i] = (long long)ifac[i + 1] * (i + 1) % mod;
  for (int i = 1; i <= n; ++i) ans = (ans - a[i]) % mod;
  for (int i = n + 1; i <= n + n; ++i) ans = (ans + a[i]) % mod;
  ans = (long long)ans * C(n + n, n) % mod;
  printf("%d", (ans + mod) % mod);
  return 0;
}
