#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n, a[300010];
long long f[300010], inv[300010];
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans % mod;
}
int main() {
  f[1] = 1;
  scanf("%lld", &n);
  for (long long i = 2; i <= n * 2; i++) {
    f[i] = f[i - 1] * i % mod;
  }
  for (int i = 1; i <= 2 * n; i++) scanf("%lld", &a[i]);
  sort(a + 1, a + 1 + 2 * n);
  long long ans = 0;
  for (int i = n + 1; i <= n * 2; i++) ans = (ans + a[i] - a[i - n]) % mod;
  ans = ((((ans * f[2 * n]) % mod) * qpow(f[n], mod - 2)) % mod) *
        qpow(f[n], mod - 2) % mod;
  cout << ans;
  return 0;
}
