#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 7, mod = 998244353;
long long n, a[maxx], b[maxx], sum;
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> a[i];
  sort(a + 1, a + 1 + 2 * n);
  for (int i = 1; i <= n; i++) sum -= a[i];
  for (int i = n + 1; i <= 2 * n; i++) sum += a[i];
  b[1] = 1;
  for (int i = 2; i <= 2 * n; i++) b[i] = b[i - 1] * i % mod;
  cout << sum % mod * b[2 * n] % mod * qpow(b[n], mod - 2) % mod *
              qpow(b[n], mod - 2) % mod
       << endl;
}
