#include <bits/stdc++.h>
using namespace std;
const long long md = 998244353;
int a[300300];
long long fac[300300];
long long qp(long long a, long long b) {
  long long ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = ret * a % md;
    a = a * a % md;
  }
  return ret;
}
long long c(long long x, long long y) {
  return fac[x] * qp(fac[x - y], md - 2) % md * qp(fac[y], md - 2) % md;
}
int main() {
  int n;
  scanf("%d", &n);
  fac[0] = 1;
  for (int i = 1; i <= 2 * n; i++) {
    scanf("%d", &a[i]);
    fac[i] = fac[i - 1] * i % md;
  }
  sort(a + 1, a + 1 + 2 * n);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += a[2 * n - i + 1] - a[i];
  }
  ans %= md;
  printf("%lld\n", ans * c(2 * n, n) % md);
  return 0;
}
