#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353, N = 3e5 + 10;
ll fa[N];
ll power(ll x, ll y) {
  ll res = 1;
  while (y) {
    if (y % 2) res = (res * x) % mod;
    x = (x * x) % mod;
    y /= 2;
  }
  return res;
}
ll inv(ll x) {
  x %= mod;
  return power(x, mod - 2);
}
ll c(ll n, ll k) { return ((fa[n] * inv(fa[k])) % mod * inv(fa[n - k])) % mod; }
int main() {
  fa[0] = 1;
  for (int i = 1; i < N; i++) fa[i] = (i * fa[i - 1]) % mod;
  int n;
  cin >> n;
  vector<int> v(2 * n);
  for (int i = 0; i < 2 * n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  ll f = 0, s = 0;
  for (int i = 0; i < 2 * n; i++) {
    if (i < n)
      f += v[i];
    else
      s += v[i];
  }
  ll ans = (s - f) % mod;
  ans *= c(2 * n, n);
  cout << (ans + mod) % mod;
  return 0;
}
