#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long power(long long a, long long n, long long p) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) {
      ans = (ans * a) % p;
    }
    a = (a * a) % p;
    n = n >> 1;
  }
  return ans;
}
long long comb(long long n, long long r) {
  long long a = 1, b = 1;
  for (long long i = r + 1; i <= n; i++) {
    a = (a * i) % mod;
  }
  for (long long i = 1; i <= n - r; i++) {
    b = (b * i) % mod;
  }
  long long inv = power(b, mod - 2, mod);
  return (a * inv) % mod;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> a(2 * n);
  for (long long i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long p = 0, q = 0;
  for (long long i = 0; i < n; i++) {
    p = (p + a[i]) % mod;
  }
  for (long long i = n; i < 2 * n; i++) {
    q = (q + a[i]) % mod;
  }
  long long d = (mod + q - p) % mod;
  long long f = comb(2 * n, n);
  long long ans = (d * f) % mod;
  cout << ans;
  return 0;
}
