#include <bits/stdc++.h>
using namespace std;
long long n, a[300005];
long long mod = 998244353;
long long qpow(long long a1, long long b) {
  if (b == 0) return 1;
  long long c = qpow(a1, b / 2);
  if (b % 2 == 0)
    return c * c % mod;
  else
    return c * c % mod * a1 % mod;
}
int main(void) {
  scanf("%lld", &n);
  for (long long i = 1; i <= n * 2; i++) scanf("%lld", &a[i]);
  sort(a + 1, a + n * 2 + 1);
  long long sum = 0;
  for (long long i = 1; i <= n; i++) {
    sum = sum + a[i + n] - a[i];
  }
  sum %= mod;
  long long n1 = 1, n2 = 1;
  for (long long i = 1; i <= n; i++) {
    n1 = n1 * i % mod;
    n2 = n2 * i % mod * (i + n) % mod;
  }
  n1 = n1 * n1 % mod;
  long long ccc = n2 * qpow(n1, mod - 2) % mod;
  long long ans = ccc * sum % mod;
  printf("%lld\n", ans);
}
