#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e9 + 7;
const long long int mod = 998244353;
long long int mini(long long int a, long long int b) {
  if (a >= b) return b;
  return a;
}
long long int maxi(long long int a, long long int b) {
  if (a >= b) return a;
  return b;
}
const long long int MAXN = 300002;
long long int factorial[MAXN + 1], inverse[MAXN + 1];
long long int binpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % mod;
    }
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long int nCk(long long int n, long long int k) {
  if (k < 0 || k > n) {
    return 0;
  }
  long long int ans = factorial[n];
  ans = (ans * inverse[n - k]) % mod;
  ans = (ans * inverse[k]) % mod;
  return ans;
}
void preCompute() {
  long long int fact = 1;
  factorial[0] = 1;
  inverse[0] = 1;
  for (long long int i = 1; i <= MAXN; i++) {
    fact = (fact * i) % mod;
    factorial[i] = fact;
    inverse[i] = binpow(factorial[i], mod - 2);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  preCompute();
  long long int n;
  cin >> n;
  long long int sumr = 0, suml = 0;
  vector<long long int> A(2 * n);
  for (long long int i = 0; i <= 2 * n - 1; i++) cin >> A[i];
  sort(A.begin(), A.end());
  for (long long int i = 0; i <= n - 1; i++) suml += A[i], suml %= mod;
  for (long long int i = n; i <= 2 * n - 1; i++) sumr += A[i], sumr %= mod;
  long long int tot = (mod + sumr - suml) % mod;
  long long int a = nCk(2 * n, n);
  long long int ans = (a * tot) % mod;
  cout << ans;
  return 0;
}
