#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return {i, j};
}
struct printer {
  ~printer() { cerr << endl; }
  template <class c>
  printer& operator,(c x) {
    cerr << boolalpha << x;
    return *this;
  }
  printer& operator,(string x) {
    cerr << x;
    return *this;
  }
  template <class c, class d>
  printer& operator,(pair<c, d> x) {
    return *this, "(", x.first, ", ", x.second, ")";
  }
  template <class... d, template <class...> class c>
  printer& operator,(c<d...> x) {
    return *this, range(begin(x), end(x));
  }
  template <class c>
  printer& operator,(rge<c> x) {
    *this, "[";
    for (auto it = x.b; it != x.e; ++it) *this, (it == x.b ? "" : ", "), *it;
    return *this, "]";
  }
};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long my_rand(long long l, long long r) {
  return uniform_int_distribution<long long>(l, r)(rng);
}
const long long mod = 998244353;
const long long inf = -1;
const long long sz = 3e5 + 10;
long long ar[sz], fact[sz];
void pre() {
  fact[0] = 1;
  for (long long i = 1; i < sz; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
}
long long bigmod(long long a, long long b, long long m) {
  if (b == 0) return 1;
  long long x = bigmod(a, b / 2, m);
  x = (x * x) % m;
  if (b % 2 == 1) x = (x * a) % m;
  return x;
}
long long ncr(long long n, long long r) {
  long long up = fact[n];
  long long down = (fact[n - r] * fact[r]) % mod;
  long long res = (up * bigmod(down, mod - 2, mod)) % mod;
  return res;
}
signed main() {
  long long n, m, i;
  pre();
  cin >> n;
  m = 2 * n;
  for (i = 0; i < m; i++) {
    cin >> ar[i];
  }
  sort(ar, ar + m);
  long long ans = 0;
  for (i = 0; i < n; i++) {
    ans = (ans + (ar[n + i] - ar[i])) % mod;
  }
  ans = (ans * ncr(m, n)) % mod;
  cout << ans << endl;
}
