#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
const long long mod = 998244353;
long long n, a[N], sum;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long power(long long x, long long y) {
  long long tmp = 1;
  while (y) {
    if (y & 1) tmp = tmp * x % mod;
    x = x * x % mod;
    y /= 2;
  }
  return tmp;
}
long long niyuan(long long x) { return power(x, mod - 2); }
long long work(long long x) {
  long long A = 1, B = 1;
  for (long long i = 1; i <= n * 2; i++) A = A * i % mod;
  for (long long i = 1; i <= n; i++) B = B * i % mod;
  return A * niyuan(power(B, 2)) % mod;
}
signed main() {
  n = read();
  for (long long i = 1; i <= n * 2; i++) a[i] = read();
  sort(a + 1, a + 2 * n + 1);
  for (long long i = 1; i <= n; i++)
    sum = ((sum + a[i + n] - a[i]) % mod + mod) % mod;
  printf("%lld\n", sum * work(n) % mod);
  return 0;
}
