#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353, a[400000], sum = 0;
long long pow(long long base, long long log) {
  if (log == 1) return base;
  long long d = pow(base, log / 2);
  if (log % 2 == 0)
    return (d * d) % mod;
  else
    return ((d * d) % mod * base) % mod;
}
signed main() {
  long long fact_n = 1, fact_2n = 1, res, n = 1;
  scanf("%lld", &n);
  for (long long i = 0; i < 2 * n; i++) scanf("%lld", &a[i]);
  sort(a, a + 2 * n);
  for (long long i = 0; i < n; i++) sum -= a[i];
  for (long long i = n; i < 2 * n; i++) sum += a[i];
  for (long long i = n + 1; i <= 2 * n; i++) fact_2n = (fact_2n * i) % mod;
  for (long long i = 1; i <= n; i++) fact_n = (fact_n * i) % mod;
  res = (fact_2n * pow(fact_n, mod - 2)) % mod;
  sum = sum % mod;
  printf("%lld", ((sum * res) % mod + mod) % mod);
}
