#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long N = 4e5;
long long fac[N];
long long qpow(long long x, long long y) {
  long long res = 1;
  for (; y; y >>= 1, x = x * x % mod)
    if (y & 1) res = res * x % mod;
  return res;
}
long long inv(long long x) { return qpow(x, mod - 2); }
long long C(long long x, long long y) {
  return ((fac[x] * inv(fac[y]) % mod) * inv(fac[x - y])) % mod;
}
void build() {
  fac[0] = 1;
  for (long long i = 1; i < N; i++) fac[i] = fac[i - 1] * i % mod;
}
long long a[N];
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  build();
  long long n;
  cin >> n;
  for (long long i = 0; i < 2 * n; i++) cin >> a[i];
  sort(a, a + 2 * n);
  for (long long i = 0; i < 2 * n; i++) a[i] %= mod;
  long long ans = 0;
  for (long long i = 0; i < n; i++) ans = (ans + a[i + n] - a[i] + mod) % mod;
  cout << ans * C(2 * n, n) % mod << '\n';
}
