#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int32_t MOD = 998244353;
const long long N = 3e5 + 5;
long long power(long long a, long long p) {
  long long res = 1;
  while (p) {
    if (p & 1) res = res * a % MOD;
    a = a * a % MOD;
    p >>= 1;
  }
  return res;
}
long long fact[N], invfact[N];
void init() {
  fact[0] = 1;
  long long i;
  for (i = 1; i < N; ++i) {
    fact[i] = fact[i - 1] * i % MOD;
  }
  i--;
  invfact[i] = power(fact[i], MOD - 2);
  for (i--; i >= 0; --i) {
    invfact[i] = invfact[i + 1] * (i + 1) % MOD;
  }
}
long long ncr(long long n, long long r) {
  if (r > n || n < 0 || r < 0) return 0;
  return fact[n] * invfact[r] % MOD * invfact[n - r] % MOD;
}
void solve() {
  long long n;
  cin >> n;
  long long a[2 * n];
  for (long long i = 0; i < 2 * n; i++) cin >> a[i];
  sort(a, a + 2 * n);
  long long ss = 0, bs = 0;
  for (long long i = 0; i < n; i++) ss += a[i];
  for (long long i = n; i < 2 * n; i++) bs += a[i];
  long long ans = (bs - ss) % MOD * ncr(2 * n, n) % MOD;
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  init();
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
