#include <bits/stdc++.h>
const int maxn = 3e6 + 5;
const int mod = 998244353;
using namespace std;
long long a[maxn], fac[maxn];
long long fpow(long long base, long long exp) {
  long long res = 1;
  while (exp) {
    if (exp & 1) res = (res * base) % mod;
    exp >>= 1;
    base = (base * base) % mod;
  }
  return res;
}
void solve() {
  long long n, ans = 0;
  cin >> n;
  fac[0] = fac[1] = 1;
  for (int i = (1); i < (2 * n + 1); i++) fac[i] = (fac[i - 1] * i) % mod;
  for (int i = (1); i < (2 * n + 1); i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 2 * n + 1);
  for (int i = (1); i < (n + 1); i++) {
    ans = (ans + abs(a[i] - a[i + n])) % mod;
  }
  cout << ans * fac[2 * n] % mod * fpow(fac[n], mod - 2) % mod *
              fpow(fac[n], mod - 2) % mod
       << '\n';
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
