#include <bits/stdc++.h>
using namespace std;
int t, n, v[300005];
long long sol = 0, fact1 = 1, fact2 = 1;
const long long MOD = 998244353;
long long putere(int n, int p) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    long long k = putere(n, p / 2);
    return k * k % MOD;
  }
  if (p % 2 == 1) return putere(n, p - 1) * n % MOD;
}
void solve() {
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> v[i];
  sort(v + 1, v + 2 * n + 1);
  for (int i = 1; i <= n; i++) sol = (sol + abs(v[2 * n - i + 1] - v[i])) % MOD;
  for (int i = 1; i <= n; i++) fact1 = (fact1 * i) % MOD;
  for (int i = 1; i <= 2 * n; i++) fact2 = (fact2 * i) % MOD;
  fact1 = putere(fact1, MOD - 2);
  sol = (sol * fact1) % MOD;
  sol = (sol * fact1) % MOD;
  sol = (sol * fact2) % MOD;
  cout << sol;
}
int main() {
  t = 1;
  while (t--) solve();
}
