#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
struct mint {
  int val;
  mint() { val = 0; }
  mint(const long long& v) {
    val = (mod <= v && v < mod) ? v : v % mod;
    if (val < 0) val += mod;
  }
  friend ostream& operator<<(ostream& os, const mint& a) { return os << a.val; }
  friend bool operator==(const mint& a, const mint& b) {
    return a.val == b.val;
  }
  friend bool operator!=(const mint& a, const mint& b) { return !(a == b); }
  friend bool operator<(const mint& a, const mint& b) { return a.val < b.val; }
  mint operator-() const { return mint(-val); }
  mint& operator+=(const mint& m) {
    if ((val += m.val) >= mod) val -= mod;
    return *this;
  }
  mint& operator-=(const mint& m) {
    if ((val -= m.val) < 0) val += mod;
    return *this;
  }
  mint& operator*=(const mint& m) {
    val = (long long)val * m.val % mod;
    return *this;
  }
  mint qpow(long long p) {
    mint ans = 1, base = val;
    for (; p; p /= 2, base *= base)
      if (p & 1) ans *= base;
    return ans;
  }
  mint inv() { return qpow((long long)mod - 2); }
  mint& operator/=(mint m) { return (*this) *= m.inv(); }
  friend mint operator+(mint a, const mint& b) { return a += b; }
  friend mint operator-(mint a, const mint& b) { return a -= b; }
  friend mint operator*(mint a, const mint& b) { return a *= b; }
  friend mint operator/(mint a, const mint& b) { return a /= b; }
  operator long long() const { return val; }
};
const int N = 3e5 + 5;
mint fact[N], invfact[N];
void precalc() {
  fact[0] = invfact[0] = 1;
  for (int i = 0; i < N - 1; i++) {
    fact[i + 1] = fact[i] * mint(i + 1);
    invfact[i + 1] = fact[i + 1].inv();
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  precalc();
  int n;
  cin >> n;
  vector<int> a(2 * n);
  for (int& i : a) cin >> i;
  sort(a.begin(), a.end());
  mint dif = 0;
  for (int i = 0; i < n; i++) {
    dif += mint(a[2 * n - 1 - i] - a[i]);
  }
  dif *= (fact[2 * n] * invfact[n] * invfact[n]);
  cout << dif << endl;
  return 0;
}
