#include <bits/stdc++.h>
using namespace std;
int a[300000];
inline int PowMod(int x, int y) {
  int res = 1;
  while (y != 0) {
    if ((y & 1) == 1) {
      res = (long long)res * x % 998244353;
    }
    y >>= 1;
    x = (long long)x * x % 998244353;
  }
  return res;
}
int main() {
  int n, f1 = 1, f2 = 1;
  cin >> n;
  for (register int i = 0; i != n << 1; i++) {
    cin >> a[i];
  }
  sort(a, a + (n << 1));
  for (register int i = 1; i <= n; i++) {
    f2 = (long long)f2 * i % 998244353;
    f1 = (long long)f1 * (i + n) % 998244353;
  }
  f1 = (long long)f1 * PowMod(f2, 998244353 - 2) % 998244353;
  int ans = 0;
  for (register int i = 0; i != n; i++) {
    ans += a[i + n] - a[i];
    if (ans >= 998244353) {
      ans -= 998244353;
    }
  }
  cout << (long long)ans * f1 % 998244353;
  return 0;
}
