#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 2e6 + 233;
long long fac[maxn], Inv[maxn];
int exgcd(int a, int b, int& x, int& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = exgcd(b, a % b, y, x);
  y -= (a / b) * x;
  return d;
}
inline long long inv(int i) {
  int x, y;
  exgcd(i, mod, x, y);
  return (x + mod) % mod;
}
void init() {
  fac[0] = Inv[0] = 1;
  for (int i = 1; i < maxn; i++) {
    fac[i] = fac[i - 1] * i % mod;
    Inv[i] = Inv[i - 1] * inv(i) % mod;
  }
}
inline long long c(int n, int k) {
  if (k > n) return 0;
  return fac[n] * Inv[k] % mod * Inv[n - k] % mod;
}
int a[maxn];
int main() {
  init();
  int n;
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + 2 * n);
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += a[i + n] - a[i];
  ans %= mod;
  ans = ans * c(2 * n, n) % mod;
  cout << ans << endl;
}
