#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long modsize = 303030;
vector<long long> fac(modsize);
vector<long long> inv(modsize);
vector<long long> facinv(modsize);
void modcalc() {
  if (modsize == 0) abort();
  fac[0] = 1;
  fac[1] = 1;
  inv[1] = 1;
  facinv[0] = 1;
  facinv[1] = 1;
  for (long long i = 2; i < modsize; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
    facinv[i] = facinv[i - 1] * inv[i] % mod;
  }
}
long long modinv(long long a) {
  if (a == 0) abort();
  long long b = mod, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}
long long modpow(long long a, long long b) {
  long long ans = 1;
  a %= mod;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long modcomb(long long n, long long k) {
  if (n < 0 || k < 0 || n < k) return 0;
  return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}
long long modperm(long long n, long long k) {
  if (n < 0 || k < 0 || n < k) return 0;
  return fac[n] * facinv[n - k] % mod;
}
long long modhom(long long n, long long k) {
  if (n < 0 || k < 0 || (n == 0 && k > 0)) return 0;
  if (n == 0 && k == 0) return 1;
  return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> a(2 * n);
  long long sum = 0;
  for (int i = 0; i < (2 * n); i++) {
    cin >> a[i];
    sum += a[i];
  }
  modcalc();
  sort(a.begin(), a.end());
  long long leftsum = 0;
  for (int i = 0; i < (n); i++) leftsum += a[i];
  long long rightsum = sum - leftsum;
  long long s = rightsum - leftsum;
  s %= mod;
  cout << modcomb(2 * n, n) * s % mod << endl;
}
