#include <bits/stdc++.h>
using namespace std;
int gi() {
  int x = 0, c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = 1;
  for (; isdigit(c); c = getchar()) x = x * 10 + (c & 15);
  return f ? -x : x;
}
const int N = 300005;
const int mod = 998244353;
int a[N];
int qpow(int a, int b) {
  int t = 1;
  while (b) {
    if (b & 1) t = 1ll * t * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return t;
}
bool cmp(const int &a, const int &b) { return a < b; }
int main() {
  int n = gi();
  for (int i = 1; i <= (n << 1); ++i) a[i] = gi();
  sort(a + 1, a + (n << 1) + 1, cmp);
  int fac = 1;
  for (int i = 1; i <= n; ++i) fac = 1ll * fac * i % mod;
  int faci = qpow(fac, mod - 2);
  for (int i = n + 1; i <= (n << 1); ++i) fac = 1ll * fac * i % mod;
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += a[n + i] - a[i];
    if (ans >= mod) ans -= mod;
  }
  printf("%d\n", 1ll * fac * faci % mod * faci % mod * ans % mod);
  return 0;
}
