#include <bits/stdc++.h>
using namespace std;
FILE* in = stdin;
FILE* out = stdout;
const int MAX = 300003;
const int MOD = 998244353;
int n;
long long a[MAX];
long long fact[MAX];
long long fastPow(long long num, int pwr) {
  long long ret = 1;
  while (pwr) {
    if (pwr & 1) {
      ret = (ret * num) % MOD;
    }
    num = (num * num) % MOD;
    pwr >>= 1;
  }
  return ret;
}
int solve() {
  sort(a, a + n);
  long long sum = 0;
  for (int i = 0; i < n / 2; i++) {
    sum += a[n - i - 1] - a[i];
  }
  sum %= MOD;
  fact[0] = 1;
  for (int i = 1; i < MAX; i++) fact[i] = (fact[i - 1] * i) % MOD;
  long long ans = 1;
  ans = (ans * fact[n]) % MOD;
  ans = (ans * fastPow(fact[n / 2], MOD - 2)) % MOD;
  ans = (ans * fastPow(fact[n / 2], MOD - 2)) % MOD;
  return (ans * sum) % MOD;
}
int main(void) {
  fscanf(in, "%d", &n);
  n *= 2;
  for (int i = 0; i < n; i++) fscanf(in, "%lld", &a[i]);
  fprintf(out, "%d\n", solve());
  return 0;
}
