#include <bits/stdc++.h>
using namespace std;
const int N = 1500005;
const int MOD = 998244353;
int n;
int dat[N * 2];
long long fact[N * 2], invFact[N * 2];
long long fastExp(long long base, int p) {
  long long ret = 1;
  while (p) {
    if (p & 1) {
      ret = (ret * base) % MOD;
    }
    base = (base * base) % MOD;
    p >>= 1;
  }
  return ret;
}
int main() {
  fact[0] = invFact[0] = 1;
  for (int i = 1; i < 2 * N; i++) {
    fact[i] = (1ll * i * fact[i - 1]) % MOD;
    invFact[i] = fastExp(fact[i], MOD - 2);
  }
  cin >> n;
  for (int i = 0; i < 2 * n; i++) {
    cin >> dat[i];
  }
  sort(dat, dat + 2 * n);
  long long combRes = fact[2 * n];
  combRes = (combRes * invFact[n]) % MOD;
  combRes = (combRes * invFact[n]) % MOD;
  long long adds = 0, mins = 0;
  for (int i = 0; i < n; i++) {
    mins += dat[i];
    adds += dat[i + n];
  }
  long long ans = (adds - mins) % MOD;
  if (ans < 0) ans += MOD;
  ans = (ans * combRes) % MOD;
  cout << ans << "\n";
  return 0;
}
