#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar();
  return x;
}
long long ksm(long long x, int c) {
  long long re = 1;
  for (; c; c >>= 1, x = x * x % 998244353)
    if (c & 1) re = re * x % 998244353;
  return re;
}
int n, a[150005 * 2];
long long P[150005 * 2], inv[150005 * 2], F[2][150005 * 2];
int main() {
  n = read();
  P[0] = inv[0] = 1;
  for (int i = 1; i <= n + n; ++i) P[i] = P[i - 1] * i % 998244353;
  inv[n + n] = ksm(P[n + n], 998244353 - 2);
  for (int i = n + n; i; --i) inv[i - 1] = inv[i] * i % 998244353;
  for (int i = 1; i <= n * 2; ++i) a[i] = read();
  sort(a + 1, a + n * 2 + 1);
  long long ans = 0;
  for (int i = n + n; i > n; --i) (ans += a[i] - a[n + n - i + 1]) %= 998244353;
  printf("%lld\n",
         ans * P[n * 2] % 998244353 * inv[n] % 998244353 * inv[n] % 998244353);
  return 0;
}
