#include <bits/stdc++.h>
using namespace std;
const int mxN = 5e5 + 10;
using ll = long long;
const int mod = 998244353;
ll a[mxN];
ll bigMod(ll n, ll p) {
  if (p == 0) return 1;
  ll h = bigMod(n, p / 2);
  h = (h * h) % mod;
  if (p & 1) h = (h * n) % mod;
  return h;
}
inline ll mod_inv(ll n, ll r) {
  return (a[n] * bigMod((a[n - r] * a[r]) % mod, mod - 2) % mod) % mod;
}
int main() {
  ll n;
  a[0] = 1;
  cin >> n;
  for (ll i = 1; i <= (n << 1); ++i) a[i] = (a[i - 1] * i) % mod;
  vector<ll> v(n << 1);
  for (auto &i : v) cin >> i;
  sort(v.begin(), v.end());
  ll sum = 0;
  for (ll i = 0; i < n; i++) sum += v[2 * n - i - 1] - v[i], sum %= mod;
  cout << (sum * mod_inv(2 * n, n)) % mod << endl;
}
