#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1e9 + 7, mod = 998244353;
const long long N = 3e5 + 7;
long long ncr[N];
void fact(long long A) {
  auto binexp = [&](long long a, long long b) {
    long long res = 1;
    while (b) {
      if (b & 1) res *= a;
      a *= a;
      b >>= 1;
      a %= mod;
      res %= mod;
    }
    return res;
  };
  ncr[0] = 1;
  for (long long i = 1; i <= A; i++)
    ncr[i] = ncr[i - 1] * (A - i + 1) % mod * binexp(i, mod - 2) % mod;
}
void a_b_l() {
  long long n;
  cin >> n;
  n <<= 1;
  long long ar[n];
  for (long long i = 0; i < n; i++) cin >> ar[i];
  sort(ar, ar + n);
  long long k = 0;
  for (long long i = 0; i < n / 2; i++) {
    k += ar[n - i - 1] - ar[i];
    k %= mod;
  }
  fact(n);
  long long ans = k * ncr[n / 2] % mod;
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  ;
  long long t = 1;
  while (t--) a_b_l();
}
