#include <bits/stdc++.h>
using namespace std;
int power(int x, int y) {
  int ans = 1;
  for (; y; y >>= 1, x = (long long)x * x % 998244353)
    if (y & 1) ans = (long long)ans * x % 998244353;
  return ans;
}
int n, a[300100];
int fact[300100], inv[300100];
int main() {
  scanf("%d", &n);
  n *= 2;
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  sort(a + 1, a + n + 1);
  fact[0] = 1;
  for (int i = 1; i <= n; i++) fact[i] = (long long)i * fact[i - 1] % 998244353;
  inv[n] = power(fact[n], 998244353 - 2);
  for (int i = n; i >= 1; i--) inv[i - 1] = (long long)i * inv[i] % 998244353;
  long long ans = 0;
  for (int i = 1; i <= n / 2; i++) ans += a[n - i + 1] - a[i];
  ans %= 998244353;
  ans = ans * fact[n] % 998244353 * inv[n / 2] % 998244353 * inv[n / 2] %
        998244353;
  printf("%lld\n", ans);
}
