#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353, N = 3e5 + 7;
long long f[N] = {1}, rf[N] = {1};
long long binpow(long long x, long long d) {
  long long ans = 1;
  while (d) {
    if (d & 1) ans = ans * x % MOD;
    x = x * x % MOD;
    d >>= 1;
  }
  return ans;
}
long long binom(long long n, long long k) {
  return f[n] * rf[k] % MOD * rf[n - k] % MOD;
}
void solve() {
  for (long long i = 1; i <= (long long)N - 1; ++i) {
    f[i] = f[i - 1] * i % MOD;
    rf[i] = binpow(f[i], MOD - 2);
  }
  long long n;
  cin >> n;
  vector<long long> v(2 * n);
  for (long long i = 0; i < (long long)2 * n; ++i) cin >> v[i];
  sort(begin(v), end(v));
  long long sum = 0;
  for (long long i = 0; i < (long long)n; ++i) sum -= v[i];
  for (long long i = n; i < 2 * n; ++i) sum += v[i];
  sum %= MOD;
  cout << binom(2 * n, n) * sum % MOD;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
