#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 5;
void self_max(long long& a, const long long& b) { a = max(a, b); }
void self_min(long long& a, const long long& b) { a = min(a, b); }
inline void preprocessing() {}
unsigned long long power(unsigned long long x, long long y, long long p) {
  unsigned long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
unsigned long long modInverse(unsigned long long n, long long p) {
  return power(n, p - 2, p);
}
unsigned long long nCrModPFermat(unsigned long long n, long long r,
                                 long long p) {
  if (n < r) return 0;
  if (r == 0) return 1;
  unsigned long long fac[n + 1];
  fac[0] = 1;
  for (long long i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
inline void solve() {
  long long n;
  cin >> n;
  vector<long long> a(2 * n);
  for (long long i = 0; i < 2 * n; i++) cin >> a[i];
  ;
  sort(a.begin(), a.end());
  long long cost = 0;
  long long mod = 998244353;
  for (long long i = 0; i < n; ++i) {
    cost += abs(a[i] - a[i + n]);
    if (cost > mod) cost -= mod;
  }
  cout << (cost * (nCrModPFermat(2 * n, n, mod))) % mod << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  preprocessing();
  solve();
}
