#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using db = double;
const int mod = 998244353;
const int maxn = 1e6;
ll qpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
long long n, m;
ll a[maxn];
ll p[maxn], invp[maxn];
void init() {
  p[1] = 1;
  for (long long i = 2; i < maxn; ++i) {
    p[i] = p[i - 1] * i % mod;
  }
  invp[maxn - 1] = qpow(p[maxn - 1], mod - 2);
  for (long long i = maxn - 2; i >= 0; --i) {
    invp[i] = invp[i + 1] * (i + 1) % mod;
  }
}
ll C(ll n, ll m) { return p[n] * invp[n - m] % mod * invp[m] % mod; }
signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  init();
  cin >> n;
  m = n * 2;
  for (long long i = 1; i <= m; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + m);
  ll tmp = 0;
  for (long long i = 1; i <= n; i++) {
    tmp -= a[i];
  }
  for (long long i = n + 1; i <= m; i++) {
    tmp += a[i];
  }
  cout << tmp % mod * C(2 * n, n) % mod << '\n';
  return 0;
}
