#include <bits/stdc++.h>
using namespace std;
vector<long long> fact;
void build() {
  long long n = 300005;
  fact.resize(n);
  fact[0] = 1;
  for (long long i = 1; i <= 300000; i++)
    fact[i] = (fact[i - 1] * i) % (998244353);
}
long long binpow(long long a, long long b) {
  a %= (998244353);
  long long ans = 1;
  while (b) {
    if (b & 1) (ans *= a) %= (998244353);
    (a *= a) %= (998244353);
    b >>= 1;
  }
  return ans;
}
long long C(long long n, long long i) {
  return (fact[n] * binpow(fact[n - i] * fact[i], (998244353) - 2)) %
         (998244353);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> nums(n * 2);
  for (long long i = 0; i < n * 2; i++) cin >> nums[i];
  sort(nums.begin(), nums.end());
  long long x = 0;
  for (long long i = 0; i < n; i++) x += (nums[n * 2 - 1 - i] - nums[i]);
  cout << (((C(n * 2, n) % (998244353)) * (x % (998244353))) % (998244353))
       << endl;
}
void t() {}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  build();
  solve();
  return 0;
}
