#include <bits/stdc++.h>
using namespace std;
template <typename... T>
void pn(T... args) {
  ((cout << args << " "), ...);
  cout << "\n";
}
template <typename... T>
void ps(T... args) {
  ((cout << args << " "), ...);
  cout << "";
}
long long power(long long a, long long b, long long P = 1000000007) {
  long long res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % P)
    if (b & 1) res = 1ll * res * a % P;
  return res;
}
const long long P = 998244353;
const long long N = 3e5;
long long fact[N + 1];
long long inv[N + 1];
void precalculate() {
  fact[0] = 1;
  inv[0] = 1;
  for (long long i = 1; i <= N; i++) {
    fact[i] = (i * fact[i - 1]) % P;
    inv[i] = power(fact[i], P - 2, P) % P;
  }
}
long long ncr(long long n, long long r) {
  if (n < 0 || r < 0 || n < r) return 0;
  return (((fact[n] * inv[r]) % P) * inv[n - r]) % P;
}
void solve() {
  long long n;
  cin >> n;
  n = n * 2;
  long long sum = 0;
  long long arr[n];
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  for (long long i = 0; i < n / 2; i++) {
    sum = (sum + abs(arr[i] - arr[n - 1 - i])) % P;
  }
  cout << (ncr(n, (n / 2)) * sum) % P << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  precalculate();
  { solve(); }
  return 0;
}
