#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
template <typename T, typename T1>
T amax(T &a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T &a, T1 b) {
  if (b < a) a = b;
  return a;
}
void OJ() {}
const long long N = 2e5 + 1235;
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b % 2 == 1) return (power(a, b - 1) * a) % 998244353;
  long long q = power(a, b / 2);
  return (q * q) % 998244353;
}
long long fact(long long n) {
  long long ans = 1;
  for (long long i = 1; i < n + 1; ++i) ans = (ans * i) % 998244353;
  return ans;
}
long long nCr(long long n, long long r) {
  long long ans =
      (fact(n) % 998244353 * power(fact(n - r), 998244353 - 2) % 998244353) %
      998244353;
  ans = (ans * power(fact(r), 998244353 - 2) % 998244353) % 998244353;
  return ans;
}
long long solve() {
  long long n;
  cin >> n;
  vector<long long> v(2 * n);
  for (long long i = 0; i < 2 * n; ++i) cin >> v[i];
  sort((v).begin(), (v).end());
  long long ans = 0;
  for (long long i = 0; i < n; ++i) ans = (ans + v[i + n] - v[i]) % 998244353;
  cout << (ans * nCr(2 * n, n)) % 998244353;
  return 0;
}
signed main() {
  OJ();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  solve(), cout << '\n';
  return 0;
}
