#include <bits/stdc++.h>
using namespace std;
const long long N = 300005;
const long long PRIME = 998244353;
long long fac[N];
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long n, long long p = PRIME) {
  return power(n, p - 2, PRIME);
}
long long ncr(long long n, long long r, long long p = PRIME) {
  if (r > n || r < 0) return 0;
  if (r == 0) return 1;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
void solve() {
  fac[0] = 1;
  for (long long i = 1; i < N; i++) fac[i] = (fac[i - 1] * i) % PRIME;
  long long n;
  cin >> n;
  vector<long long> a(2 * n);
  for (long long i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort((a).begin(), (a).end());
  long long diff = 0;
  for (long long i = 0; i < n; i++) {
    diff += (a[i + n] - a[i]);
    diff %= PRIME;
  }
  cout << diff * ncr(2 * n, n, PRIME) % PRIME << "\n";
  return;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
