#include <bits/stdc++.h>
using namespace std;
const int MAXN = 150000 * 2 + 5;
const int mod = 998244353;
int a[MAXN], n;
int fac[MAXN], ifac[MAXN];
long long poww(long long x, long long n) {
  long long ans = 1;
  while (n) {
    if (n & 1) ans = ans * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return ans;
}
void init() {
  fac[0] = ifac[0] = 1;
  for (int i = 1; i <= 2 * n; i++) {
    fac[i] = 1ll * i * fac[i - 1] % mod;
    ifac[i] = poww(fac[i], mod - 2) % mod;
  }
  return;
}
int C(int n, int k) {
  if (n < k || k < 0) return 0;
  return 1ll * fac[n] * ifac[k] % mod * ifac[n - k] % mod;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) {
    cin >> a[i];
  }
  init();
  sort(a + 1, a + 1 + 2 * n);
  long long ans = 0;
  for (int i = n + 1; i <= 2 * n; i++) {
    ans += a[i] - a[i - n];
  }
  ans %= mod;
  ans = ans * C(2 * n, n) % mod;
  cout << ans << '\n';
  return 0;
}
