#include <bits/stdc++.h>
using namespace std;
long long mas[300000];
long long mod = 998244353;
long long binpow(long long a, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 1)
    return (binpow(a, n - 1) % mod * a) % mod;
  else {
    long long b = binpow(a, n / 2) % mod;
    return (b * b) % mod;
  }
}
long long fac[300001];
int main() {
  long long n;
  fac[0] = 1;
  for (int i = 1; i <= 300000; i++) fac[i] = (fac[i - 1] * i) % mod;
  cin >> n;
  for (int i = 0; i < 2 * n; i++) cin >> mas[i];
  sort(mas, mas + 2 * n);
  long long s = 0;
  for (int i = 2 * n - 1; i >= n; i--) s = (s + mas[i]) % mod;
  for (int i = 0; i < n; i++) s = (s + mod - mas[i]) % mod;
  s = (((s * fac[2 * n]) % mod * (binpow(fac[n], mod - 2) % mod)) % mod *
       (binpow(fac[n], mod - 2) % mod)) %
      mod;
  cout << s;
  return 0;
}
