#include <bits/stdc++.h>
using namespace std;
const int N = 300000, P = 998244353;
int a[N + 5], fac[N + 5], ivf[N + 5];
int n, m, ans;
int main() {
  scanf("%d", &n), m = n << 1;
  fac[0] = 1;
  for (int i = 1; i <= m; i++) fac[i] = 1ll * fac[i - 1] * i % P;
  ivf[0] = ivf[1] = 1;
  for (int i = 2; i <= m; i++) ivf[i] = 1ll * ivf[P % i] * (P - P / i) % P;
  for (int i = 1; i <= m; i++) ivf[i] = 1ll * ivf[i - 1] * ivf[i] % P;
  for (int i = 1; i <= m; i++) scanf("%d", &a[i]);
  sort(a + 1, a + m + 1);
  for (int i = 1; i <= n; i++) ans = (ans - a[i] + P) % P;
  for (int i = n + 1; i <= m; i++) ans = (ans + a[i]) % P;
  ans = 1ll * ans * fac[m] % P * ivf[n] % P * ivf[n] % P;
  printf("%d\n", ans);
}
