#include <bits/stdc++.h>
using namespace std;
const long long SIZE = (long long)3e5 + 5;
long long fact[SIZE + 1];
long long fastex(long long a, long long b) {
  if (b == 0) return 1;
  long long t = fastex(a, b / 2) % 998244353, x = (t * t) % 998244353;
  if (b & 1)
    return (x * a) % 998244353;
  else
    return x;
}
long long inverse(long long x) { return fastex(x, 998244353 - 2); }
void precal(long long n) {
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % 998244353;
  }
}
long long nCr(long long n, long long r) {
  if (r > n) {
    return 0;
  }
  return fact[n] * ((inverse(fact[n - r]) * inverse(fact[r])) % 998244353) %
         998244353;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  precal(n * 2);
  long long ar[2 * n];
  for (long long i = 0; i < n * 2; i += 1) {
    cin >> ar[i];
  }
  sort(ar, ar + 2 * n);
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    ans -= ar[i];
  }
  for (long long i = n; i < 2 * n; i++) {
    ans += ar[i];
  }
  ans %= 998244353;
  ans = (ans * nCr(2 * n, n)) % 998244353;
  cout << ans << "\n";
  return 0;
}
