#include <bits/stdc++.h>
using namespace std;
const long long N = 3E5 + 7, mod = 998244353;
long long n, a[N], inv[N], ans;
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n << 1; i++) scanf("%lld", &a[i]);
  sort(a + 1, a + 2 * n + 1);
  for (long long i = 1; i <= n; i++) ans = (ans - a[i] + mod) % mod;
  for (long long i = n + 1; i <= n << 1; i++) ans = (ans + a[i]) % mod;
  for (long long i = n << 1; i >= n + 1; i--) ans = ans * i % mod;
  inv[1] = 1;
  for (long long i = 2; i <= n; i++) {
    inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
    ans = 1ll * ans * inv[i] % mod;
  }
  printf("%lld\n", ans);
  return 0;
}
