#include <bits/stdc++.h>
using namespace std;
const int64_t MAX = 510000;
const int64_t MOD = 998244353;
int64_t fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
int64_t COM(int64_t n, int64_t k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
  int N;
  cin >> N;
  COMinit();
  vector<int> vec(2 * N);
  for (int i = 0; i < 2 * N; i++) {
    cin >> vec[i];
  }
  sort(vec.begin(), vec.end());
  int64_t L = 0;
  int64_t R = 0;
  for (int i = 0; i < 2 * N; i++) {
    if (i < N) {
      L += vec[i];
    } else {
      R += vec[i];
    }
  }
  cout << (COM(2 * N, N) * ((R - L) % MOD)) % MOD << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  T = 1;
  for (int i = 0; i < T; i++) {
    solve();
  }
}
