#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
inline long long qpow(long long x, long long e) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % MOD;
    x = x * x % MOD;
    e >>= 1;
  }
  return ans;
}
long long n, a[300005];
signed main() {
  scanf("%d", &n);
  for (long long i = 1; i <= 2 * n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 2 * n + 1);
  long long sum = 0;
  for (long long i = 1; i <= n; i++) sum -= a[i];
  for (long long i = n + 1; i <= 2 * n; i++) sum += a[i];
  sum %= MOD;
  long long c = 1;
  for (long long i = 1; i <= 2 * n; i++) c = c * i % MOD;
  for (long long i = 1; i <= n; i++) c = c * qpow(i, MOD - 2) % MOD;
  for (long long i = 1; i <= n; i++) c = c * qpow(i, MOD - 2) % MOD;
  cout << sum * c % MOD << endl;
  return 0;
}
