#include <bits/stdc++.h>
using namespace std;
void solve();
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
long long modular_exp(long long a, long long n) {
  if (n == 0) return 1;
  long long res = 1;
  while (n > 0) {
    if (n % 2 != 0) res *= a;
    a = (a * a) % 998244353;
    n = n / 2;
    res = res % 998244353;
  }
  res = (res % 998244353);
  return res;
}
long long factorial[1500001];
void StoreFactorials(long long n) {
  factorial[0] = 1;
  for (long long i = 1; i <= n; i++) {
    factorial[i] = (i * factorial[i - 1]) % 998244353;
  }
}
long long invmod(long long x) { return modular_exp(x, 998244353 - 2); }
long long nCr(long long n, long long r) {
  return (factorial[n] *
          invmod((factorial[r] * factorial[n - r]) % 998244353)) %
         998244353;
}
void solve() {
  long long n;
  cin >> n;
  long long arr[2 * n];
  for (auto &x : arr) cin >> x;
  sort(arr, arr + 2 * n);
  long long res = 0;
  for (long long i = 0; i < 2 * n; i++) {
    if (i < n)
      res -= arr[i];
    else
      res += arr[i];
  }
  res %= 998244353;
  StoreFactorials(2 * n);
  res *= nCr(2 * n, n);
  res %= 998244353;
  cout << res;
  cout << "\n";
  return;
}
