#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long res = 1;
  x = x % 998244353;
  while (y > 0) {
    if (y & 1) res = (res * x) % 998244353;
    y = y >> 1;
    x = (x * x) % 998244353;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long n;
  cin >> n;
  ;
  vector<long long> v(2 * n);
  for (int i = (long long)0; i < 2 * n; i++) cin >> v[i];
  long long total = 1;
  for (int i = (long long)1; i <= 2 * n; i++) total = (total * i) % 998244353;
  long long need = 1;
  for (int i = (long long)1; i <= n; i++) need = (need * i) % 998244353;
  need = (need * need) % 998244353;
  long long ans = power(need, 998244353 - 2);
  ans = (ans * total) % 998244353;
  long long sum = 0;
  sort(v.begin(), v.end());
  for (long long i = 0, j = 2 * n - 1; i < j; i++, j--)
    sum = (sum + abs(v[i] - v[j])) % 998244353;
  ans = (ans * sum) % 998244353;
  cout << ans % 998244353;
  return 0;
}
