#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
const long long INF = 1e18;
const int mod = 998244353;
int a[maxn], n;
int h[maxn];
long long ans;
int qpow(int x, int n) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * x % mod;
    x = (long long)x * x % mod;
    n >>= 1;
  }
  return ret;
}
int rev(int x) { return qpow(x, mod - 2); }
int main() {
  h[1] = 1;
  for (int i = 2; i < maxn; ++i) h[i] = (long long)h[i - 1] * i % mod;
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + 2 * n);
  for (int i = 1; i <= n; ++i) ans -= a[i];
  for (int i = n + 1; i <= n * 2; ++i) ans += a[i];
  ans %= mod;
  ans = ans * h[2 * n] % mod * rev(h[n]) % mod * rev(h[n]) % mod;
  cout << ans << '\n';
  return 0;
}
