#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
const int MOD = 998244353;
long long pow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % MOD;
    b /= 2;
    a = (a * a) % MOD;
  }
  return ans;
}
long long fac[N];
long long invfac[N];
int C(int x, int y) {
  if (y > x) return 0;
  return (long long)fac[x] * invfac[y] % MOD * invfac[x - y] % MOD;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    fac[0] = 1;
    for (int i = 1; i <= 2 * n; ++i) fac[i] = (long long)fac[i - 1] * i % MOD;
    invfac[2 * n] = pow(fac[2 * n], MOD - 2, MOD);
    for (int i = 2 * n; i >= 1; --i)
      invfac[i - 1] = (long long)invfac[i] * i % MOD;
    long long a[2 * n];
    for (int i = 0; i < 2 * n; i++) cin >> a[i];
    sort(a, a + 2 * n);
    long long sum[2 * n];
    sum[0] = a[0];
    for (int i = 1; i < 2 * n; i++) sum[i] = sum[i - 1] + a[i];
    long long ans = sum[2 * n - 1] - 2 * sum[n - 1];
    ans %= MOD;
    int ans1 = C(2 * n, n);
    ans1 %= MOD;
    ans *= ans1;
    ans %= MOD;
    cout << ans;
    cout << "\n";
  }
}
