#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, m;
ll ans;
ll T, U, D;
ll A[400010];
ll quick(ll a, ll b) {
  ll ans = 1;
  a %= 998244353;
  while (b) {
    if (b & 1) ans = ans * a % 998244353;
    a = a * a % 998244353;
    b >>= 1;
  }
  return ans % 998244353;
}
int main() {
  cin >> n;
  for (int i = 0; i < 2 * n; i++) {
    cin >> A[i];
  }
  sort(A, A + 2 * n);
  T = 0;
  U = D = 1;
  for (int i = 0; i < n; i++) {
    T += (A[2 * n - i - 1] - A[i]);
    T %= 998244353;
    U = U * (2 * n - i) % 998244353;
    D = D * (i + 1) % 998244353;
  }
  D = quick(D, 998244353 - 2);
  U = (U * D) % 998244353;
  ans = (U * T) % 998244353;
  cout << ans << endl;
  return 0;
}
