#include <bits/stdc++.h>
using namespace std;
long long int factorial[(long long int)(3e5 + 5) + 1];
long long int invFactorial[(long long int)(3e5 + 5) + 1];
long long int inverse(long long int x) {
  long long int pow = (long long int)(998244353) - 2;
  long long int res = 1;
  while (pow != 0) {
    if (pow % 2 == 0) {
      x = (x * x) % (long long int)(998244353);
      pow = pow / 2;
    } else {
      res = (res * x) % (long long int)(998244353);
      pow--;
    }
  }
  return res;
}
long long int nCr(long long int n, long long int r) {
  if (r > n) return 0;
  long long int toReturn = ((factorial[n] * invFactorial[n - r]) %
                            (long long int)(998244353) * invFactorial[r]) %
                           (long long int)(998244353);
  return toReturn;
}
int main() {
  factorial[0] = 1;
  for (long long int i = 1; i <= (long long int)(3e5 + 5); i++)
    factorial[i] = (factorial[i - 1] * i) % (long long int)(998244353);
  invFactorial[(long long int)(3e5 + 5)] =
      inverse(factorial[(long long int)(3e5 + 5)]);
  for (long long int i = (long long int)(3e5 + 5) - 1; i >= 0; i--)
    invFactorial[i] =
        (invFactorial[i + 1] * (i + 1)) % (long long int)(998244353);
  long long int n, L, R;
  cin >> n;
  n = n * 2;
  vector<long long int> arr(n);
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  sort(arr.begin(), arr.end());
  L = R = 0;
  for (long long int i = 0; i < n / 2; i++)
    L = (L + arr[i]) % (long long int)(998244353);
  for (long long int i = n / 2; i < n; i++)
    R = (R + arr[i]) % (long long int)(998244353);
  long long int d =
      (R - L + (long long int)(998244353)) % (long long int)(998244353);
  long long int ans = (d * nCr(n, n / 2)) % (long long int)(998244353);
  cout << ans << endl;
}
