#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int mod = 998244353;
int a[maxn];
int f[maxn], g[maxn], r[maxn];
void init() {
  f[0] = g[0] = f[1] = g[1] = r[1] = 1;
  for (int i = 2; i < maxn; i++) {
    f[i] = (long long)f[i - 1] * i % mod;
    r[i] = (long long)(mod - mod / i) * r[mod % i] % mod;
    g[i] = (long long)g[i - 1] * r[i] % mod;
  }
}
inline int nCm(int n, int m) {
  if (m < 0 || m > n) return 0;
  return (long long)f[n] * g[m] % mod * g[n - m] % mod;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  init();
  int n;
  cin >> n;
  int m = n << 1;
  for (int i = 1; i <= m; i++) cin >> a[i];
  sort(a + 1, a + m + 1);
  long long ans = 0;
  for (int i = 1, j = m; i <= n; i++, j--) ans = (ans + abs(a[i] - a[j])) % mod;
  ans = (ans * nCm(m, n)) % mod;
  cout << ans;
  return 0;
}
