#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int M = 1e6 + 5;
const long long Mod = 998244353;
namespace FASTIO {
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
}  // namespace FASTIO
using namespace FASTIO;
long long a[N << 1], f[N << 1];
void init() {
  f[0] = 1;
  for (int i = 1; i < N * 2; ++i) f[i] = f[i - 1] * i % Mod;
}
long long quick_mi(long long a, long long b) {
  long long re = 1;
  while (b) {
    if (b & 1) re = re * a % Mod;
    a = a * a % Mod;
    b >>= 1;
  }
  return re;
}
long long C(int n, int m) {
  return f[n] * quick_mi(f[m], Mod - 2) % Mod * quick_mi(f[n - m], Mod - 2) %
         Mod;
}
int main() {
  init();
  int n;
  n = read();
  for (int i = 1; i <= 2 * n; ++i) a[i] = read();
  sort(a + 1, a + 2 * n + 1);
  long long sum1 = 0, sum2 = 0;
  for (int i = 1; i <= n; ++i) sum1 += a[i];
  for (int i = n + 1; i <= 2 * n; ++i) sum2 += a[i];
  long long dis = (sum2 - sum1) % Mod;
  long long ans = dis * C(2 * n, n) % Mod;
  printf("%lld\n", ans);
  return 0;
}
