#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long power(long long a, long long b, long long mod) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2) {
      x = (x * y) % mod;
    }
    y = (y * y) % mod;
    b /= 2;
  }
  return x % mod;
}
long long modular_inverse(long long n, long long mod) {
  return power(n, mod - 2, mod);
}
long long n, x;
void solve() {
  cin >> n;
  vector<long long> arr(2 * n, 0);
  for (long long i = 0; i < 2 * n; i++) cin >> arr[i];
  sort(arr.begin(), arr.end());
  long long sum = 0;
  long long sum1 = 0;
  long long sum2 = 0;
  for (long long i = 0; i < n; i++) {
    sum += abs(arr[2 * n - i - 1] - arr[i]);
    sum %= MOD;
  }
  long long s1 = 1, s2 = 1;
  for (long long i = 1; i <= n; i++) {
    s1 *= i;
    s1 %= MOD;
  }
  s1 = modular_inverse(s1, MOD);
  for (long long i = n + 1; i <= 2 * n; i++) {
    s2 *= i;
    s2 %= MOD;
  }
  s2 = s2 * s1;
  s2 %= MOD;
  long long ans = sum * s2;
  ans %= MOD;
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
