#include <bits/stdc++.h>
using namespace std;
ifstream fin("input");
void init() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
}
const long long mod = 998244353;
int n;
vector<int> v;
void read() {
  cin >> n;
  v.resize(2 * n);
  for (int i = 0; i < 2 * n; i++) cin >> v[i];
}
long long fact(int x) {
  long long result = 1;
  for (int i = 2; i <= x; i++) {
    result = (result * i) % mod;
  }
  return result;
}
long long fastpow(long long base, long long power) {
  long long fact = base, result = 1;
  for (long long i = 1; i <= power; i = i << 1) {
    if ((power & i) != 0) {
      result = (result * fact) % mod;
    }
    fact = (fact * fact) % mod;
  }
  return result;
}
long long comb(int n, int k) {
  long long a = fact(n);
  long long b = (fact(k) * fact(n - k)) % mod;
  return (a * fastpow(b, mod - 2)) % mod;
}
void solve() {
  vector<int> a(v.begin(), v.begin() + n), b(v.begin() + n, v.end());
  sort(a.begin(), a.end());
  sort(b.begin(), b.end(), std::greater<int>());
  long long s = 0;
  for (int i = 0; i < n; i++) {
    s += abs(a[i] - b[i]);
  }
  s = s % mod;
  long long ans = (s * comb(2 * n, n)) % mod;
  cout << ans;
}
int main() {
  init();
  read();
  solve();
  return 0;
}
