#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long N = 1e6 + 6;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long powmod(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long readn() {
  long long sum = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = sum * 10 + (ch - '0');
    ch = getchar();
  }
  return sum * f;
}
long long a[N], ans, n;
int main() {
  n = readn();
  for (long long i = 1; i <= 2 * n; i++) a[i] = readn();
  sort(a + 1, a + 1 + 2 * n);
  long long op = 1, k = 1;
  for (long long i = 1; i <= 2 * n; i++) op = op * i % mod;
  for (long long i = 1; i <= n; i++) k = k * i % mod;
  op = op * powmod(k, mod - 2) % mod * powmod(k, mod - 2) % mod;
  for (long long i = n + 1; i <= 2 * n; i++) ans += a[i];
  for (long long i = 1; i <= n; i++) ans -= a[i];
  ans %= mod;
  cout << ans * op % mod << endl;
}
