#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long bin_pow(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  long long res = bin_pow(a, b / 2);
  res *= res;
  res %= mod;
  if (b % 2) {
    res *= a;
    res %= mod;
  }
  return res;
}
long long inv(long long x) { return bin_pow(x, mod - 2); }
int32_t main() {
  ios_base::sync_with_stdio(0);
  long long n;
  cin >> n;
  n *= 2;
  vector<long long> a(n);
  for (long long i = 0; i < (long long)(n); i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long ans = 0;
  n /= 2;
  for (long long i = 0; i < (long long)(n); i++) {
    ans -= a[i];
  }
  for (long long i = 0; i < (long long)(n); i++) {
    ans += a[i + n];
  }
  ans %= mod;
  for (long long i = 0; i < (long long)(n); i++) {
    ans *= n + 1 + i;
    ans %= mod;
  }
  for (long long i = 0; i < (long long)(n); i++) {
    ans *= inv(i + 1);
    ans %= mod;
  }
  cout << ans << endl;
}
