#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353, maxn = 3e5 + 1, inf = 1e9, alpha = 26,
                maxk = 20;
long long t[maxn];
long long bp(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
long long inv(long long x) { return bp(x, mod - 2); }
long long c(long long n, long long k) {
  return t[n] * inv(t[k]) % mod * inv(t[n - k]) % mod;
}
long long a[300000];
void solve() {
  t[0] = 1;
  for (long long i = 1; i <= maxn; i++) t[i] = (t[i - 1] * i) % mod;
  long long n;
  cin >> n;
  for (long long i = 0; i < n * 2; i++) {
    cin >> a[i];
  }
  long long k = c(2 * n - 1, n - 1) * 2;
  sort(a, a + 2 * n);
  long long sum = 0;
  for (long long i = 0; i < n * 2; i++) {
    if (i >= n) {
      sum += a[i] * k;
      sum %= mod;
    } else {
      sum -= a[i] * k;
      sum %= mod;
      sum = (sum + mod) % mod;
    }
  }
  cout << sum;
}
signed main() {
  long long t = 1;
  while (t--) {
    solve();
  }
}
