#include <bits/stdc++.h>
using namespace std;
const int NMAX = 300002;
const int MOD = 998244353;
int v[NMAX];
long long int powlg(long long int x, long long int p) {
  long long v = 1, a = x;
  while (p > 0) {
    while (p % 2 == 0) {
      a = a * a % MOD;
      p /= 2;
    }
    v = v * a % MOD;
    p--;
  }
  return v;
}
long long int comb(long long int n, long long int k) {
  if (k > n - k) k = n - k;
  long long int c = 1, f = 1;
  for (long long int i = 1; i <= k; i++) {
    c = c * (n - i + 1) % MOD;
    f = f * i % MOD;
  }
  c = c * powlg(f, MOD - 2) % MOD;
  return c;
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> v[i];
  sort(v + 1, v + 2 * n + 1);
  long long sum1 = 0, sum2 = 0;
  for (int i = 1; i <= n; i++) sum1 += v[i];
  for (int i = n + 1; i <= 2 * n; i++) sum2 += v[i];
  long long dif = sum2 - sum1;
  dif %= MOD;
  cout << comb(2 * n, n) * dif % MOD;
  return 0;
}
