#include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::max;
using std::min;
int n, A[300005], fac[300005], inv[300005], ans;
int cal(int x) {
  x -= x < 998244353 ? 0 : 998244353;
  return x;
}
int C(int x, int y) {
  return x < 0 || y < 0 || x < y
             ? 0
             : (long long)fac[x] * inv[y] % 998244353 * inv[x - y] % 998244353;
}
int main() {
  scanf("%d", &n), n <<= 1, fac[0] = inv[0] = inv[1] = 1;
  for (int i = 1; i <= n; i++) scanf("%d", &A[i]);
  for (int i = 1; i <= n; i++) fac[i] = (long long)fac[i - 1] * i % 998244353;
  for (int i = 2; i <= n; i++)
    inv[i] =
        (long long)(998244353 - 998244353 / i) * inv[998244353 % i] % 998244353;
  for (int i = 2; i <= n; i++)
    inv[i] = (long long)inv[i - 1] * inv[i] % 998244353;
  std::sort(A + 1, A + 1 + n);
  for (int i = 1; i <= n; i++)
    ans = i > n / 2 ? cal(ans + A[i] % 998244353)
                    : cal(ans - A[i] % 998244353 + 998244353);
  ans = 2ll * ans * C(n - 1, n / 2 - 1) % 998244353;
  printf("%d\n", ans);
  return 0;
}
