#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10, mod = 998244353;
int fac[N], inv[N], a[N];
int main() {
  int n, m, ans = 0;
  fac[0] = 1;
  for (int i = 1; i < N; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
  inv[1] = 1;
  for (int i = 2; i < N; i++)
    inv[i] = 1LL * inv[mod % i] * (mod - mod / i) % mod;
  inv[0] = 1;
  for (int i = 1; i < N; i++) inv[i] = 1LL * inv[i - 1] * inv[i] % mod;
  scanf("%d", &n), m = n << 1;
  for (int i = 1; i <= m; i++) scanf("%d", a + i);
  sort(a + 1, a + m + 1);
  for (int i = 1; i <= m; i++)
    if (a[i] >= mod) a[i] -= mod;
  for (int i = n + 1; i <= m; i++) {
    ans += a[i];
    if (ans >= mod) ans -= mod;
  }
  for (int i = 1; i <= n; i++) {
    ans -= a[i];
    if (ans < 0) ans += mod;
  }
  printf("%lld\n", 1LL * ans * fac[m] % mod * inv[n] % mod * inv[n] % mod);
  return 0;
}
