#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const long long N = 3e5 + 10;
long long fact[N];
void init() {
  fact[0] = 1;
  for (long long i = 1; i < N; i++) {
    fact[i] = (fact[i - 1] * i) % MOD;
  }
}
long long takemod(long long a, long long mod = MOD) {
  a %= mod;
  if (a < 0) a += mod;
  return a;
}
long long fast_exp(long long base, long long expo, long long mod = MOD) {
  long long res = 1;
  while (expo > 0) {
    if (expo & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    expo >>= 1;
  }
  return res;
}
long long modinv(long long a, long long mod = MOD) {
  return takemod(fast_exp(takemod(a), mod - 2, mod), mod);
}
long long ncr(long long n, long long r) {
  if (n < r) {
    return 0;
  }
  long long f = fact[n];
  long long k = modinv(fact[n - r]);
  k = (k * modinv(fact[r])) % MOD;
  f = (f * k) % MOD;
  return f;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  n = 2 * n;
  init();
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    if (i < n / 2) {
      sum -= a[i];
    } else {
      sum += a[i];
    }
    sum %= MOD;
  }
  sum += MOD;
  sum %= MOD;
  long long res = (ncr(n, n / 2)) % MOD * sum;
  res %= MOD;
  cout << res << endl;
  return 0;
}
