#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const long long inf = 0x3f3f3f3f;
const long long oo = 8e18;
const int dir[][2] = {{0, 1}, {1, 0},  {0, -1}, {-1, 0},
                      {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
long long fac[maxn], inv1[maxn];
long long Pow(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans = ans * a % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long inv(long long b) { return Pow(b, mod - 2) % mod; }
long long C(long long n, long long m) {
  if (m > n || n < 0 || m < 0) return 0;
  if (m == 0 || m == n) return 1;
  long long res = (fac[n] * inv1[m] % mod * inv1[n - m]) % mod;
  return res;
}
void init() {
  fac[0] = 1;
  for (int i = 1; i < maxn; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  inv1[maxn - 1] = Pow(fac[maxn - 1], mod - 2);
  for (int i = maxn - 2; i >= 0; i--) {
    inv1[i] = inv1[i + 1] * (i + 1) % mod;
  }
}
long long a[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  init();
  for (int i = 1; i <= 2 * n; i++) cin >> a[i];
  sort(a + 1, a + 1 + 2 * n);
  long long ans = 0;
  for (int i = 1; i <= 2 * n; i++) {
    if (i <= n)
      ans = (ans - a[i] + mod) % mod;
    else
      ans = (ans + a[i]) % mod;
  }
  cout << ans * C(2 * n, n) % mod << '\n';
  return 0;
}
