#include <bits/stdc++.h>
const int mod = 998244353;
const int modd = 233317;
const int base = 131;
const double pi = acos(-1);
const int N = 2e5 + 10;
const int M = 1e9;
using namespace std;
long long int m, n, v, e = 0, tot = 0, a[5000100], aa[1500010], b[1500010];
long long int mypow(long long int x, long long int xp) {
  long long int ans = 1;
  while (xp) {
    if (xp & 1) {
      ans *= x;
      ans %= mod;
    }
    x *= x;
    x %= mod;
    xp >>= 1;
  }
  ans %= mod;
  return ans;
}
void innt() {
  long long int i, j;
  aa[0] = 1;
  for (i = 1; i <= n; i++) {
    aa[i] = aa[i - 1] * i;
    aa[i] %= mod;
  }
  b[1] = 1;
  for (i = 2; i <= n; i++) {
    b[i] = mypow(i, mod - 2);
  }
  for (i = 2; i <= n; i++) {
    b[i] *= b[i - 1];
    b[i] %= mod;
  }
}
void cinn() {
  long long int i;
  for (i = 1; i <= 2 * n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + 2 * n);
}
int main() {
  long long int zt, k, i, j, x, y, z, q, l, r, ma;
  ios::sync_with_stdio(false);
  cin >> n;
  cinn();
  l = 0;
  r = 0;
  innt();
  for (i = 1; i <= n; i++) l += a[i];
  for (i = n + 1; i <= 2 * n; i++) r += a[i];
  long long int d = (r - l) % mod;
  ma = 0;
  for (i = 1; i <= n - 1; i++) {
    long long int cp = (((aa[n] * b[i]) % mod) * b[n - i]) % mod;
    ma += cp * cp;
    ma %= mod;
  }
  ma += 2;
  ma *= d;
  ma %= mod;
  cout << ma << endl;
  return 0;
}
