#include <bits/stdc++.h>
using namespace std;
const long long N = 1000005;
const long long mod = 998244353;
long long n, a[N], ans;
long long qpow(long long p, long long q) {
  return (q & 1 ? p : 1) * (q ? qpow(p * p % mod, q / 2) : 1) % mod;
}
long long inv(long long p) { return qpow(p, mod - 2); }
signed main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (long long i = 1; i <= n + n; i++) cin >> a[i];
  sort(a + 1, a + n + n + 1);
  for (long long i = 1; i <= n; i++) ans -= a[i];
  for (long long i = n + 1; i <= n + n; i++) ans += a[i];
  ans %= mod;
  for (long long i = 1; i <= n; i++) ans = ans * (n + i) % mod;
  for (long long i = 1; i <= n; i++) ans = ans * inv(i) % mod;
  cout << ans << endl;
  return 0;
}
