#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const double eps = 1e-10;
const long long INF = 1e18;
const int N = 3e5 + 10;
inline int inv(int a) {
  if (a < 0) a += MOD;
  int b = MOD, u = 0, v = 1;
  while (a) {
    int t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += MOD;
  return u;
}
int fact[N], invfact[N];
void init() {
  fact[0] = 1;
  int i;
  for (i = 1; i < N; i++) {
    fact[i] = (1ll * i * fact[i - 1]) % MOD;
  }
  i--;
  invfact[i] = inv(fact[i]);
  for (i--; i >= 0; i--) {
    invfact[i] = (1ll * invfact[i + 1] * (i + 1)) % MOD;
  }
}
int ncr(int n, int r) {
  return (((1ll * fact[n] * invfact[r]) % MOD) * 1ll * invfact[n - r]) % MOD;
}
void solve() {
  int n;
  cin >> n;
  vector<int> odd, even;
  for (int i = 0; i < 2 * n; i++) {
    int x;
    cin >> x;
    if (i & 1)
      odd.push_back(x);
    else
      even.push_back(x);
  }
  sort(odd.begin(), odd.end());
  sort(even.begin(), even.end(), greater<int>());
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans += abs(odd[i] - even[i]);
  }
  ans %= MOD;
  ans *= ncr(2 * n, n);
  cout << ans % MOD;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  init();
  int tt = 1;
  while (tt--) {
    solve();
  }
  return 0;
}
