#include <bits/stdc++.h>
using namespace std;
long long a[500020];
long long inv(long long b) {
  return b == 1 || b == 0
             ? 1
             : (998244353 - 998244353 / b) * inv(998244353 % b) % 998244353;
}
long long f[500020];
long long C(long long n, long long m) {
  return f[n] * inv(f[m]) % 998244353 * inv(f[n - m]) % 998244353;
}
void init() {
  f[0] = 1;
  for (int i = 1; i < 500020; i++) f[i] = f[i - 1] * i % 998244353;
}
inline void solve() {
  long long n;
  init();
  scanf("%lld", &n);
  for (int i = 1; i <= 2 * n; ++i) scanf("%d", &a[i]);
  sort(a + 1, a + 2 * n + 1);
  long long l = 0, r = 0;
  for (int i = 1; i <= n; ++i) l += a[i];
  for (int i = n + 1; i <= 2 * n; ++i) r += a[i];
  printf("%lld\n", (1ll * (r - l) % 998244353 * C(2 * n, n)) % 998244353);
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
}
