#include <bits/stdc++.h>
using namespace std;
const int maxn = 150000 * 2 + 5;
const int mod = 998244353;
long long fac[maxn], ifac[maxn];
long long a[maxn];
long long qpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return res;
}
long long C(long long n, long long k) {
  if (k > n || k < 0) return 0;
  return fac[n] * ifac[k] % mod * ifac[n - k] % mod;
}
void init() {
  fac[0] = ifac[0] = 1;
  for (long long i = 1; i < maxn; i++) {
    fac[i] = fac[i - 1] * i % mod;
    ifac[i] = qpow(fac[i], mod - 2);
  }
}
int main() {
  init();
  int n;
  cin >> n;
  for (int i = 1; i <= n * 2; i++) {
    scanf("%lld", &a[i]);
  }
  sort(a + 1, a + 1 + n * 2);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += abs(a[i] - a[2 * n - i + 1]);
    ans = ans % mod;
  }
  ans = ans * C(2 * n, n) % mod;
  cout << ans << endl;
  return 0;
}
