#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, unsigned long long int y,
                    long long int p) {
  long long int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2, p);
}
const long long int N = 300000;
long long int fac[N + 1];
void precomp(long long int p) {
  fac[0] = 1;
  for (long long int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % p;
}
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
  if (r == 0) return 1;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  precomp(998244353);
  long long int n;
  cin >> n;
  vector<long long int> a(2 * n);
  for (long long int k_ = 0; k_ < 2 * n; k_++) {
    cin >> a[k_];
  };
  sort(a.begin(), a.end());
  long long int sum = 0;
  for (long long int i = 0; i < n; i++) {
    sum += (a[2 * n - i - 1] - a[i]);
  }
  sum %= 998244353;
  cout << (sum * nCrModPFermat(2 * n, n, 998244353)) % 998244353;
  return 0;
}
